(I3
I102
I8
(dp0
Vtaxi.%l
p1
(Vtaxi.cpp
p2
S'#include<bits/stdc++.h>\r\nusing namespace std;\r\n\r\nint km[100001], ceni[100001];\r\nint n, not_n, nots[100000], i, s, mark;\r\nint main()\r\n{\r\n///Entering\r\n    cin >> n;\r\n    for(i = 0; i < n; i++)\r\n    {\r\n        cin >> km[i];\r\n    }\r\n    for(i = 0; i < n; i++)\r\n    {\r\n        cin >> ceni[i];\r\n    }\r\n    cin >> not_n;\r\n    for(i = 0; i < not_n; i++)\r\n    {\r\n        cin >> nots[i];\r\n        nots[i]-=1;\r\n    }\r\n/// /// ///\r\n    sort(ceni, ceni + n);\r\n    reverse(ceni, ceni + n);\r\n    for(i = 0; i < not_n; i++)\r\n    {\r\n        ceni[ nots[i] ] = 0;\r\n        km[ nots[i] ] = 0;\r\n    }\r\n    sort(ceni, ceni + n);\r\n    reverse(ceni, ceni + n);\r\n    sort(km, km + n);\r\n    reverse(km, km + n);\r\n/// /// ///\r\n    mark = n - not_n - 1;\r\n    for(i = 0; i < n; i++)\r\n    {\r\n        s = s + ceni[i] * km[mark];\r\n        mark--;\r\n    }\r\n\r\n    cout << s << endl;\r\n}\r\n'
p3
tp4
stp5
.