Submission #89034

#TimeUsernameProblemLanguageResultExecution timeMemory
89034luka1234Schools (IZhO13_school)C++14
10 / 100
288 ms5344 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,x,y,mx1=0,mx2=0,s=1;
    cin>>n>>x>>y;
    pair<int,int> a[n],b[n];

    for(int k=0;k<n;k++){
        cin>>a[k].first;
        cin>>a[k].second;
        b[k].first=a[k].second;
        b[k].second=a[k].first;
    }

    sort(a,a+n);
    sort(b,b+n);

    for(int k=0;k<x;k++){
        mx1=mx1+a[n-s].first;
        s++;
    }
    s=x+1;
    for(int k=0;k<y;k++){
        mx1=mx1+a[n-s].second;
    }
    s=1;

     for(int k=0;k<y;k++){
        mx2=mx2+b[n-s].first;
        s++;
    }
    s=y+1;

    for(int k=0;k<x;k++){
        mx2=mx2+b[n-s].second;
    }
    cout<<max(mx1,mx2);

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...