#include <bits/stdc++.h>
#define ff first
#define ss second
#define cont continue;
#define sz size()
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 20005;
priority_queue <pair <int, int>, vector<pair <int, int>>, greater<pair <int, int>>> v;
queue <int> q;
int a, b[N], l, n, kl;
int sum;
map <int, vector <pair <int, int>>> m;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n >> kl;
for (int i = 1; i <= n; ++i) {
cin >> a;
v.push({i, a});
}
for (int i = 1; i <= kl; ++i) {
cin >> b[i];
}
int jp = 2 * kl;
while ( jp-- ) {
cin >> l;
if (l > 0) q.push(l);
int a1 = q.front();
if (l > 0) {
if (!v.empty()) {
q.pop();
m[a1].pb ({v.top().first,v.top().second});
v.pop();
}
}
else {
// q.pop();
l *= -1;
sum += (b[l] * m[l][0].ss);
v.push({m[l][0].ff,m[l][0].ss});
m[l].clear();
if (a1 > 0) {
if (!v.empty()) {
q.pop();
m[a1].pb ({v.top().first,v.top().second});
v.pop();
}
}
}
}
cout << sum << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
324 KB |
Output is correct |
8 |
Correct |
1 ms |
328 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Runtime error |
1 ms |
456 KB |
Execution killed with signal 11 |
12 |
Runtime error |
1 ms |
592 KB |
Execution killed with signal 11 |
13 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
14 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
15 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
16 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
17 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
18 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
19 |
Correct |
2 ms |
468 KB |
Output is correct |
20 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |