# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155508 | karma | Garage (IOI09_garage) | C++14 | 4 ms | 504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define Task "test"
#define pb emplace_back
using namespace std;
const int N = 2002;
int w[N], r[N], n, m, res, id, pos[N];
priority_queue<int, vector<int>, greater<int>> pq;
queue<int> q;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
if(fopen(Task".inp", "r")) {
freopen(Task".inp", "r", stdin);
freopen(Task".out", "w", stdout);
}
cin >> n >> m;
for(int i = 1; i <= n; ++i) cin >> r[i], pq.push(i);
for(int i = 1; i <= m; ++i) cin >> w[i];
for(int i = 1; i <= 2 * m; ++i) {
cin >> id;
if(id > 0) q.push(id);
else pq.push(pos[-id]);
while(pq.size() && q.size()) {
id = q.front(); q.pop();
pos[id] = pq.top(); pq.pop();
res += w[id] * r[pos[id]];
}
}
cout << res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |