# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339498 | 2020-12-25T14:00:21 Z | tengiz05 | Schools (IZhO13_school) | C++17 | 387 ms | 10812 KB |
#include <bits/stdc++.h> #define int long long using namespace std; const int N = 3e5+5; pair<int, int> a[N]; bool cmp(pair<int, int> A, pair<int, int> B){ return A.first - A.second >= B.first - B.second; } int pr[N]; int sf[N]; main(){ int n, m, s; cin >> n >> m >> s; for(int i=1;i<=n;i++){ cin >> a[i].first >> a[i].second; } sort(a+1, a+n+1, cmp); priority_queue<int, vector<int>, greater<int>> q; int sum = 0; for(int i=1;i<=n;i++){ q.push(a[i].first); sum += a[i].first; if(q.size() > m){ sum -= q.top();q.pop(); }pr[i] = sum; } while(q.size())q.pop(); sum = 0; for(int i=n;i>=1;i--){ q.push(a[i].second); sum += a[i].second; if(q.size() > s){ sum -= q.top();q.pop(); }sf[i] = sum; } // pr[0] = pr[1]; //sf[n+1] = sf[n]; int ans = 0; for(int i=m;i<n-s+1;i++)ans = max(ans, pr[i] + sf[i+1]); cout << ans << '\n'; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 0 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
6 | Correct | 1 ms | 364 KB | Output is correct |
7 | Correct | 4 ms | 492 KB | Output is correct |
8 | Correct | 4 ms | 620 KB | Output is correct |
9 | Correct | 4 ms | 492 KB | Output is correct |
10 | Correct | 4 ms | 492 KB | Output is correct |
11 | Correct | 6 ms | 640 KB | Output is correct |
12 | Correct | 4 ms | 492 KB | Output is correct |
13 | Correct | 32 ms | 1768 KB | Output is correct |
14 | Correct | 64 ms | 3176 KB | Output is correct |
15 | Correct | 126 ms | 5356 KB | Output is correct |
16 | Correct | 148 ms | 7776 KB | Output is correct |
17 | Correct | 268 ms | 8160 KB | Output is correct |
18 | Correct | 300 ms | 8672 KB | Output is correct |
19 | Correct | 326 ms | 9312 KB | Output is correct |
20 | Correct | 387 ms | 10812 KB | Output is correct |