#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, m; cin >> n >> m;
ll r[n + 1], w[m + 1];
vector<int>tmp(n + 1);
priority_queue<int, vector<int>, greater<int>>pq;
queue<int>q;
for(int i = 1; i <= n; i++){
cin >> r[i];
pq.push(i);
}
for(int i = 1; i <= m; i++) cin >> w[i];
ll ans = 0;
for(int i = 0; i < 2*m; i++){
int x; cin >> x;
if(x > 0) q.push(x);
int now = (q.empty()) ? 0 : q.front();
if(x < 0){
pq.push(tmp[-x]);
}
if(now > 0 && !pq.empty()){
tmp[now] = pq.top();
ans += r[pq.top()] * w[now];
pq.pop();
q.pop();
}
}
cout << ans << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 6 |
2 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 6 |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
5 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
6 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
7 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
8 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
9 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
10 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 6 |
11 |
Runtime error |
1 ms |
420 KB |
Execution killed with signal 6 |
12 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 6 |
13 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
14 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
15 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 6 |
16 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 6 |
17 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 6 |
18 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 6 |
19 |
Runtime error |
2 ms |
332 KB |
Execution killed with signal 11 |
20 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 6 |