# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339498 | tengiz05 | Schools (IZhO13_school) | C++17 | 387 ms | 10812 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>
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |