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