# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173429 | juggernaut | 학교 설립 (IZhO13_school) | C++14 | 320 ms | 13964 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.
//Just try and the idea will come!
#include<bits/stdc++.h>
using namespace std;
int n,i,a,b,pr[300001],sf[300001],sum;
pair<int,int>p[300001];
multiset<int>st;
bool cmp(pair<int,int>l,pair<int,int>r){
return l.first-l.second>r.first-r.second;
}
int main(){
scanf("%d%d%d",&n,&a,&b);
for(i=1;i<=n;i++)scanf("%d%d",&p[i].first,&p[i].second);
sort(p+1,p+1+n,cmp);
for(i=1;i<=n;i++){
sum+=p[i].first;
st.insert(p[i].first);
if(i>a){
sum-=*st.begin();
st.erase(st.begin());
}
pr[i]=sum;
}
st.clear();
sum=0;
for(i=n;i>0;i--){
sum+=p[i].second;
st.insert(p[i].second);
if(n+1>b+i){
sum-=*st.begin();
st.erase(st.begin());
}
sf[i]=sum;
}
sum=0;
for(i=a;i<=n-b;i++)sum=max(sum,pr[i]+sf[i+1]);
printf("%d",sum);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |