# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328871 | cgiosy | Schools (IZhO13_school) | C++17 | 90 ms | 3820 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;
using ll=long long;
struct pii {
int a, b;
bool operator<(const pii b) const { return a>b.a; }
};
int main() {
ios::sync_with_stdio(0);cin.tie(0);
int N, X, Y;
cin>>N>>X>>Y;
vector<pii> A(N);
for(auto&[a,b]:A) cin>>a>>b;
sort(A.begin(), A.end());
for(int i=X; i<N; i++) swap(A[i].a, A[i].b);
sort(A.begin()+X, A.end());
priority_queue<int> Qa, Qb;
ll s=0;
for(int i=0; i<X+Y; i++) s+=A[i].a, (i<X ? Qa : Qb).push(A[i].b-A[i].a);
while(Qa.size() && Qb.size()) {
int a=Qa.top(); Qa.pop();
int b=Qb.top(); Qb.pop();
if(a+b<=0) break;
s+=a+b;
}
cout<<s<<'\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |