# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676393 | 2022-12-30T15:41:18 Z | vjudge1 | Schools (IZhO13_school) | C++17 | 126 ms | 16528 KB |
#include <bits/stdc++.h> #define oo 1e18 #define ii pair<int,int> using namespace std; long long id[300010],a[300010],b[300010],x,y,n,f[300010],g[300010]; priority_queue<long long,vector<long long>,greater<long long> >pq; bool cmp(int i,int j) { return a[i] - b[i] < a[j] - b[j]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> x >> y; for (int i = 1;i <= n;i++) { cin >> a[i] >> b[i]; } for (int i = 1;i <= n;i++) { id[i] = i; } sort(id + 1,id + n + 1,cmp); for (int i = 1;i <= n;i++) { f[i] = f[i - 1] + b[id[i]]; pq.push(b[id[i]]); if (pq.size() > y) { f[i] -= pq.top(); pq.pop(); } } while (pq.size() > 0) { pq.pop(); } for (int i = n;i >= 1;i--) { g[i] = g[i + 1] + a[id[i]]; pq.push(a[id[i]]); if (pq.size() > x) { g[i] -= pq.top(); pq.pop(); } } long long res = 0; for (int i = 1;i <= n;i++) { if ((i >= y) && (n - i >= x)) { res = max(res,f[i] + g[i + 1]); } } cout << res; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Incorrect | 0 ms | 340 KB | Output isn't correct |
3 | Correct | 1 ms | 324 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 2 ms | 596 KB | Output is correct |
8 | Correct | 2 ms | 596 KB | Output is correct |
9 | Correct | 2 ms | 596 KB | Output is correct |
10 | Correct | 2 ms | 596 KB | Output is correct |
11 | Correct | 2 ms | 596 KB | Output is correct |
12 | Correct | 2 ms | 596 KB | Output is correct |
13 | Correct | 13 ms | 2520 KB | Output is correct |
14 | Correct | 32 ms | 4460 KB | Output is correct |
15 | Correct | 57 ms | 8392 KB | Output is correct |
16 | Correct | 90 ms | 10592 KB | Output is correct |
17 | Correct | 101 ms | 12360 KB | Output is correct |
18 | Correct | 101 ms | 13328 KB | Output is correct |
19 | Correct | 112 ms | 14344 KB | Output is correct |
20 | Correct | 126 ms | 16528 KB | Output is correct |