(I3
I115
I8
(dp0
Vtaxi.%l
p1
(Vtaxi.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nlong long n,rDoKyshta[100000],taxes[100000],k,i,j,sbor=0;\r\nbool sravni(long long a,long long b){\r\n\r\n    return a>b;\r\n}\r\nint main(){\r\n    cin>>n;\r\n    for(i=0;i<n;i++){\r\n        cin>>rDoKyshta[i];\r\n    }\r\n    for(i=0;i<n;i++){\r\n        cin>>taxes[i];\r\n    }\r\n\r\n    cin>>k;\r\n    for(i=0;i<k;i++){\r\n        cin>>j;\r\n        rDoKyshta[j-1]=102;\r\n        taxes[n-i-1]=0;\r\n    }\r\n    sort(taxes+0,taxes+n);\r\n    sort(rDoKyshta+0,rDoKyshta+n,sravni);\r\n    for(i=0;i<n;i++){\r\n        sbor=sbor+rDoKyshta[i]*taxes[i];\r\n    }\r\n    cout<<sbor<<endl;\r\nreturn 0;\r\n}\r\n'
p3
tp4
stp5
.