(I3
I120
I8
(dp0
Vtaxi.%l
p1
(Vtaxi.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,k,cena=0,v;\r\n cin >> n;\r\n long long km[n],cn[n];\r\n for(long long a=1;a<=n;a++){\r\n    cin>>km[a];\r\n }\r\n for(long long b=1;b<=n;b++){\r\n    cin>>cn[b];\r\n }\r\n cin>>k;\r\n long long nm[k];\r\n long long q=n+1;\r\n\r\n for (long long z=1;z<=k;z++){\r\n    cin >> nm[z];\r\n }\r\n\r\n sort (cn+1,cn+q);\r\n for (long long c=n;c>0;c--){\r\n    for(long long d=1,v=1;d<=k;d++){\r\n        if (c==nm[d]){break;}\r\n        else{cena=cena+km[c]*cn[d];v++;}\r\n    }\r\n }\r\n\r\n cout << cena;\r\n\r\n cout << endl;\r\n return 0;\r\n}\r\n'
p3
tp4
stp5
.