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