(I3
I112
I8
(dp0
Vtaxi.%l
p1
(Vtaxi.cpp
p2
S'#include <iostream>\r\n\r\n#include <algorithm>\r\n\r\nusing namespace std;\r\n\r\nlong long razstoqnie[100000], Nmb[100000], price[100000];\r\n\r\nint main () {\r\n\r\n    long long N, K, i, j, Copy, tmp, stop, Sum = 0;\r\n\r\n    cin >> N;\r\n    for (i = 0; i < N; i++) {\r\n        cin >> razstoqnie[i];\r\n    }\r\n    for (i = 0; i < N; i++) {\r\n        cin >> price[i];\r\n    }\r\n    cin >> K;\r\n    for (j = 0; j < K; j++) {\r\n        cin >> Nmb[j];\r\n    }\r\n    for (i = 0; i < N; i++) {\r\n        for (j = 0; j < K; j++) {\r\n            razstoqnie[Nmb[j] - 1] = -1;\r\n        }\r\n    }\r\n    sort (razstoqnie + 0, razstoqnie + N);\r\n    sort (price + 0, price + N);\r\n    Copy = K;\r\n    for (i = N - 1; Copy > 0; i--) {\r\n        price[i] = -1;\r\n        Copy = Copy - 1;\r\n    }\r\n    for (i = 0; i < N; i++) {\r\n        for (j = N - 1; j >= 0; j--) {\r\n            if (price[i] >= 0 && razstoqnie[j] >= 0) {\r\n                Sum = Sum + (razstoqnie[j] * price[i]);\r\n                i++;\r\n            }\r\n        }\r\n    }\r\n    cout << Sum;\r\nreturn 0;\r\n}\r\n'
p3
tp4
stp5
.