# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88965 | tarash117 | 학교 설립 (IZhO13_school) | C++14 | 214 ms | 5484 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;
int used1[100001];
int used2[100001];
int main(){
int n,m,s;
cin>>n>>m>>s;
int b[n+1],a[n+1];
for(int i=1;i<=n;i++)
cin>>a[i]>>b[i];
int mxm=a[1],mxs=b[1],mxi=1;
used1[1]=1;
for(int i=2;i<=n;i++){
if(a[i]>mxm&&used1[i]<m){
mxm=a[i];
used1[i]++;
used1[mxi]--;
mxi=i;
}
}
for(int i=1;i<=n;i++)
if(used1[i]<s&&b[i]>mxs)
mxs=b[i];
int mx1=mxs+mxm;
mxs=b[1],mxm=a[1],mxi=1;
for(int i=2;i<=n;i++){
if(b[i]>mxs&&used2[i]<s){
mxs=b[i];
used2[i]++;
used2[mxi]--;
mxi=i;
}
}
for(int i=1;i<=n;i++)
if(used2[i]<m&&a[i]>mxm)
mxm=a[i];
int mx2=mxm+mxs;
cout<<max(mx1,mx2);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |