# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
84459 | talip | Schools (IZhO13_school) | C++14 | 179 ms | 9364 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>
using namespace std;
const int N = 300005;
int n, m, q, a[N], b[N], p[N];
long long int f[N], g[N], s, res;
//Memory leak with vector......
//Will test against greater<int>
bool fark(int x, int y) {
return a[x] - b[x] < a[y] - b[y];
}
int main() {
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin >> n >> m >> q;
for (int i = 0; i < n; ++i){
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; ++i){
p[i] = i;
}
sort(p, p + n, fark); priority_queue<int> pq; s = 0;
for(int i = 0; i < n; ++i) {
pq.push(-b[p[i]]); s += b[p[i]];
if (pq.size()>q) {
s += pq.top(); pq.pop();
}
f[i] = s;
}
while(pq.size()){
pq.pop();
}
s = 0;
for(int i=n-1;i>=0;i--){
pq.push(-a[p[i]]); s += a[p[i]];
if (pq.size()>m) {
s+=pq.top(); pq.pop();
}
g[i] = s;
}
for (int i = q - 1; i < n - m; ++i){
res = max(res, f[i] + g[i + 1]);
}
cout << res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |