(I3
I110
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, sum=0, i, k, j;\r\n  cin >> n;\r\n  long long km[n], cena[n];\r\n  for (i=0; i<n; i++) {\r\n    cin >> km[i];\r\n  }\r\n  for (i=0; i<n; i++) {\r\n    cin >> cena[i];\r\n  }\r\n  sort (cena+0, cena+n);\r\n  cin >> k;\r\n  long long precakani[k];\r\n  for (j=0; j<k; j++) {\r\n    cin >> precakani[j];\r\n  }\r\n  sort (precakani+0, precakani+k);\r\n  long long m=n-k;\r\n  long long ostanali[m], p;\r\n  for (i=p=j=0; i<n; i++) {\r\n    if (i==precakani[j]) {\r\n      j++;\r\n    }\r\n    else {\r\n      ostanali[p]=km[i];\r\n    }\r\n  }\r\n  for (j=0, i=m; j<m; i--, j++) {\r\n    sum+=ostanali[j]*cena[i];\r\n  }\r\n\r\n  cout << sum << endl;\r\n\r\n  return 0;\r\n}\r\n'
p3
tp4
stp5
.