# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
725519 | vjudge1 | Schools (IZhO13_school) | C++17 | 4 ms | 596 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 F first
#define S second
using namespace std;
using ll = long long;
using PI = pair<ll, ll>;
using PII = pair<PI, ll>;
int main()
{
freopen("school.in", "r", stdin);
freopen("school.out", "w", stdout);
//ios_base::sync_with_stdio(0); cin.tie(0);
ll n, m, s; cin >> n >> m >> s;
vector<PII> vp(n+10);
for(ll i = 0; i < n; i++){
cin >> vp[i].F.F >> vp[i].F.S;
vp[i].S = i;
}
vector<PII> ord;
for(ll i = 0; i < n; i++){
ord.push_back({{vp[i].F.F-vp[i].F.S, vp[i].F.F}, i});
}
sort(ord.begin(), ord.end(), [&](PII a, PII b){
if(a.F.F != b.F.F){
return a.F.F > b.F.F;
}
return a.F.S > b.F.S;
});
ll ans = 0;
ll indx = 0;
vector<bool> vis(n+10);
while(m--){
ans += vp[ord[indx].S].F.F;
vis[ord[indx].S] = true;
indx++;
}
sort(vp.begin(), vp.end(), [&](PII a, PII b){
if(a.F.S != b.F.S){
return a.F.S > b.F.S;
}
return a.F.F > b.F.F;
});
ll cnt = 0;
ll i = 0;
while(cnt != s && i != n-1){
if(!vis[vp[i].S]){
ans += vp[i].F.S;
cnt++;
}
i++;
}
cout << ans <<"\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |