Submission #328871

#TimeUsernameProblemLanguageResultExecution timeMemory
328871cgiosySchools (IZhO13_school)C++17
25 / 100
90 ms3820 KiB
#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 timeMemoryGrader output
Fetching results...