#include <bits/stdc++.h>
#define ll long long
#define x first
#define y second
using namespace std;
int main() {
ll n,l,r;
ll ans=0;
vector<pair<ll,ll> >a;
cin>>n>>l>>r;
a.resize(n+1);
for(ll i=1;i<=n;i++)
cin>>a[i].x>>a[i].y;
sort(a.begin()+1,a.end());
reverse(a.begin()+1,a.end());
multiset<ll>q;
multiset <pair<ll,ll> > os1,os2;
for(ll i=1;i<=l;i++)
{
ans+=a[i].x;
q.insert(-a[i].y+a[i].x);
}
for(ll i=l+1;i<=n;i++)
{
os1.insert(a[i]);
os2.insert({a[i].y,a[i].x});
}
for (ll i=r;i>0;i--){
pair<ll,ll>fat,sad;
fat=*os1.rbegin();
sad=*os2.rbegin();
ll f1=-*q.begin();
if(f1+fat.x>sad.x)
{
ans+=f1+fat.x;
q.erase(q.begin());
ll p=fat.y-fat.x;
q.insert(p);
os1.erase(os1.find(fat));
os2.erase(os2.find({fat.y, fat.x}));
}
else{
ans +=sad.x;
os2.erase(os2.find(sad));
os1.erase(os1.find({sad.y, sad.x}));
}
}
cout<< ans;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
380 KB |
Output is correct |
| 3 |
Correct |
2 ms |
588 KB |
Output is correct |
| 4 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
| 6 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
| 7 |
Incorrect |
8 ms |
1092 KB |
Output isn't correct |
| 8 |
Incorrect |
7 ms |
1092 KB |
Output isn't correct |
| 9 |
Incorrect |
7 ms |
1092 KB |
Output isn't correct |
| 10 |
Incorrect |
7 ms |
1092 KB |
Output isn't correct |
| 11 |
Incorrect |
10 ms |
1092 KB |
Output isn't correct |
| 12 |
Incorrect |
10 ms |
1220 KB |
Output isn't correct |
| 13 |
Incorrect |
43 ms |
3096 KB |
Output isn't correct |
| 14 |
Incorrect |
173 ms |
10920 KB |
Output isn't correct |
| 15 |
Incorrect |
368 ms |
22812 KB |
Output isn't correct |
| 16 |
Incorrect |
584 ms |
24156 KB |
Output isn't correct |
| 17 |
Incorrect |
435 ms |
24804 KB |
Output isn't correct |
| 18 |
Incorrect |
493 ms |
27100 KB |
Output isn't correct |
| 19 |
Incorrect |
509 ms |
29860 KB |
Output isn't correct |
| 20 |
Incorrect |
583 ms |
35128 KB |
Output isn't correct |
