(I3
I98
I8
(dp0
Vtaxi.%l
p1
(Vtaxi.cpp
p2
S'#include <iostream>\r\n#include <algorithm>\r\nusing namespace std;\r\nint main()\r\n{\r\n    int n, k, r[100500], c[100500], ost[100500], neshto[100500], neshto2[100500], i=0, i2=0, i3=0, i4=0, i5=0, minc=0;\r\n    cin>>n;\r\n    for (i=0; i<n; i++){\r\n        cin>>r[i];\r\n    }\r\n    for (i=0; i<n; i++){\r\n        cin>>c[i];\r\n    }\r\n    cin>>k;\r\n    for (i=0; i<k; i++){\r\n        cin>>ost[i];\r\n    }\r\n    //---------------------\r\n    for (i=0; i<n; i++){\r\n        if (i==ost[i]-1){\r\n            r[i]=0;\r\n        }\r\n    }\r\n    while (i5<n-k){\r\n        i3=0;\r\n        i4=0;\r\n        while (true){\r\n            if (r[i2]!=0){\r\n                neshto[i4]=r[i2]*c[i3];\r\n            }\r\n            else i2++;\r\n            i3++;\r\n            if (i3>=n) break;\r\n            i4++;\r\n        }\r\n        sort(neshto, neshto+i4);\r\n        minc=minc+neshto[0];\r\n        i5++;\r\n    }\r\n    cout<<minc<<endl;\r\n\r\n    return 0;\r\n}\r\n/*\r\n5\r\n2 5 3 6 4\r\n5 2 1 5 5\r\n2\r\n1 2\r\n*/\r\n'
p3
tp4
stp5
.