(I3
I97
I8
(dp0
Vtaxi.%l
p1
(V2.cpp
p2
S'#include <iostream>\r\n#include <algorithm>\r\nusing namespace std;\r\nint main ()\r\n{\r\n    int a,b,c,d,e,n,i,km[100000],pari[100000],k1[100000],k,obsh=0,i1,r=0;\r\n    cin>>n;\r\n    for (i=0;i<n;i++)cin>>km[i];\r\n    for (i=0;i<n;i++)cin>>pari[i];\r\n    cin>>k;\r\n    for (i=0;i<k;i++)cin>>k1[i];\r\n    for (i=0;i<n;i++)\r\n    {\r\n        for (i1=0;i1<k;i1++)if (i+1==k1[i])km[i]=-1;\r\n    }\r\n    sort (km,km+n);\r\n    sort (pari , pari+n);\r\n    for (i=0;i<n;i++)\r\n    {\r\n        if (km[i]==-1)continue;\r\n        obsh=obsh+(km[i]*pari[n-1-i]);\r\n    }\r\n    cout<<obsh<<endl;\r\n    return 0;\r\n}\r\n\r\n'
p3
tp4
stp5
.