# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168280 | juggernaut | Schools (IZhO13_school) | C++14 | 221 ms | 8568 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 int
using namespace std;
int n,a,b,i,c1,c2;
pair<int,int>v[300001];
bool fr(pair<int,int>l,pair<int,int>r){
return l.first>r.first||l.first==r.first&&l.second<r.second;
}
bool sc(pair<int,int>l,pair<int,int>r){
return l.second>r.second||l.second==r.second&&l.first<r.first;
}
main(){
scanf("%lld%lld%lld",&n,&a,&b);
for(i=1;i<=n;i++)scanf("%lld%lld",&v[i].first,&v[i].second);
sort(v+1,v+1+n,fr);
for(i=1;i<=a;i++)c1+=v[i].first;
sort(v+1+a,v+1+n,sc);
for(i=a+1;i<=a+b;i++)c1+=v[i].second;
sort(v+1,v+1+n,sc);
for(i=1;i<=b;i++)c2+=v[i].second;
sort(v+1+b,v+1+n,fr);
for(i=b+1;i<=a+b;i++)c2+=v[i].first;
cout<<max(c1,c2);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |