#include <bits/stdc++.h>
#define ll long long
using namespace std;
multiset < pair < int, int > > x;
vector < pair < int, int > > v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m, s;
cin >> n >> m >> s;
for (int k=1; k<=n; k++) {
int f, s;
cin >> f >> s;
v.push_back({f,s});
x.insert({(s-f),s});
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
ll ans=0;
for (int k=0; k<n; k++) {
if (s==0 && m==0) break;
if (s==0) {
ans+=v[k].first;
m--;
continue;
}
if (m==0) {
while (s) {
ans+=(*x.begin()).second;
s--;
x.erase(x.begin());
}
continue;
}
pair < int, int > p=(*x.begin());
if (p.first==-v[k].first+v[k].second && p.second==v[k].second) {
ans+=v[k].second;
s--;
x.erase(x.begin());
} else {
ans+=v[k].first;
m--;
}
}
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Incorrect |
2 ms |
576 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
576 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
576 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
576 KB |
Output isn't correct |
7 |
Incorrect |
5 ms |
872 KB |
Output isn't correct |
8 |
Incorrect |
5 ms |
876 KB |
Output isn't correct |
9 |
Incorrect |
5 ms |
876 KB |
Output isn't correct |
10 |
Incorrect |
5 ms |
876 KB |
Output isn't correct |
11 |
Incorrect |
5 ms |
876 KB |
Output isn't correct |
12 |
Incorrect |
5 ms |
876 KB |
Output isn't correct |
13 |
Incorrect |
29 ms |
2792 KB |
Output isn't correct |
14 |
Incorrect |
75 ms |
4860 KB |
Output isn't correct |
15 |
Incorrect |
207 ms |
9244 KB |
Output isn't correct |
16 |
Incorrect |
184 ms |
10468 KB |
Output isn't correct |
17 |
Incorrect |
237 ms |
12544 KB |
Output isn't correct |
18 |
Incorrect |
296 ms |
13924 KB |
Output isn't correct |
19 |
Incorrect |
301 ms |
14820 KB |
Output isn't correct |
20 |
Incorrect |
419 ms |
17176 KB |
Output isn't correct |