#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
//#define endl '\n'
llo n,m,s;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m>>s;
vector<pair<llo,llo>> kk;
for(llo i=0;i<n;i++){
llo aa,bb;
cin>>aa>>bb;
kk.pb({aa,bb});
}
sort(kk.begin(),kk.end());
llo su=0;
reverse(kk.begin(),kk.end());
set<pair<llo,llo>> ss;
set<pair<llo,llo>> tt;
set<pair<llo,llo>> mm;
for(llo i=0;i<n;i++){
if(i<m){
su+=kk[i].a;
ss.insert({kk[i].a-kk[i].b,i});
}
else{
tt.insert({-kk[i].b,i});
mm.insert({-kk[i].a,i});
}
}
if(m==n){
cout<<su<<endl;
return 0;
}
for(llo i=0;i<s;i++){
llo x=-(*tt.begin()).a;
llo y=-(*ss.begin()).a-(*mm.begin()).a;
if(y>x){
su+=y;
ss.erase(ss.begin());
pair<llo,llo> no=*(mm.begin());
mm.erase(mm.begin());
mm.insert({kk[no.b].a-kk[no.b].b,no.b});
}
else{
pair<llo,llo> no=*(tt.begin());
tt.erase(tt.begin());
su+=-no.a;
}
}
cout<<su<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
5 |
Incorrect |
4 ms |
256 KB |
Output isn't correct |
6 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
7 |
Incorrect |
8 ms |
896 KB |
Output isn't correct |
8 |
Incorrect |
7 ms |
768 KB |
Output isn't correct |
9 |
Incorrect |
7 ms |
768 KB |
Output isn't correct |
10 |
Incorrect |
7 ms |
768 KB |
Output isn't correct |
11 |
Incorrect |
8 ms |
1024 KB |
Output isn't correct |
12 |
Incorrect |
8 ms |
1024 KB |
Output isn't correct |
13 |
Incorrect |
27 ms |
3448 KB |
Output isn't correct |
14 |
Incorrect |
81 ms |
10856 KB |
Output isn't correct |
15 |
Correct |
225 ms |
22740 KB |
Output is correct |
16 |
Incorrect |
242 ms |
24416 KB |
Output isn't correct |
17 |
Incorrect |
219 ms |
26076 KB |
Output isn't correct |
18 |
Incorrect |
237 ms |
28384 KB |
Output isn't correct |
19 |
Incorrect |
264 ms |
31200 KB |
Output isn't correct |
20 |
Incorrect |
338 ms |
36456 KB |
Output isn't correct |