(I3
I107
I8
(dp0
Vtaxi.%l
p1
(Vtaxi.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint km[100000],lv[100000],st[100000];\r\nint main()\r\n{\r\nint n,k,suma,ch,flag;\r\ncin>>n;\r\nfor (int i=0;i<n;i++) cin>>km[i];\r\nfor (int i=0;i<n;i++) cin>>lv[i];\r\ncin>>k;\r\nfor (int i=0;i<k;i++)\r\n{\r\ncin>>ch;\r\nst[i]=km[ch-1];\r\n}\r\nsort(lv,lv+n);\r\nsort(km,km+n);\r\nreverse(km,km+n);\r\nsuma=0;\r\nfor (int i=0;i<n;i++)\r\n{\r\nfor (int j=0;j<n;j++)\r\n{\r\nflag=0;\r\nfor (int p=0;p<k;p++) if (st[p]==km[i]) {flag=1; break;}\r\nif (flag==0)\r\n{\r\nsuma+=km[i]*lv[j];\r\n}\r\n}\r\n}\r\ncout<<suma<<endl;\r\nreturn 0;\r\n}\r\n/**\r\nINPUT:\r\n5\r\n2 5 3 6 4\r\n5 2 1 5 5\r\n2\r\n1 2\r\nOUTPUT:\r\n29\r\n*/\r\n'
p3
tp4
stp5
.