# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89121 | tamazineb | 학교 설립 (IZhO13_school) | C++14 | 0 ms | 0 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 main()
{
int n,t=0,j=0,p=0,m,k,mx=-1,nx=-1,o,q;
cin>>n>>m>>k;
int a[n+1],b[n+1];
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
t=t+a[i];
j=j+b[i];
}
if(t>=j){
while(k!=0){
for(int v=1;v<=n;v++){
if(b[v]>=mx){
mx=b[v];
q=v;
}
}
k--;
p=p+mx;
b[q]=-2;
a[q]=-2;
}
while(m!=0){
for(int v=1;v<=n;v++){
if(a[v]>=nx){
nx=a[v];
o=v;
}
}
m--;
p=p+nx;
a[o]=-2;
b[o]=-2;
}
}
else
{
while(m!=0){
for(int v=1;v<=n;v++){
if(a[v]>=nx){
xn=a[v];
q=v;
}
}
m--;
p=p+nx;
a[q]=-2;
b[q]=-2;
}
while(k!=0){
for(int v=1;v<=n;v++){
if(b[v]>=mx){
mx=b[v];
o=v;
}
}
k--;
p=p+mx;
b[o]=-2;
a[o]=-2;
}
}
cout<<p;
return 0;
}