baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-25 05:11:59 +00:00
Code Releases Activity

#636. 0819购物 (shopping)

Browse Source 
https://sjzezoj.com/submission/19204
This commit is contained in:
Baoshuo Ren 2021-08-21 18:52:53 +08:00 committed by Baoshuo Ren
parent bc3cfa7174
commit f593a4176c
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 50 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

50
S2OJ/636/636.cpp Normal file
View File

@ -0,0 +1,50 @@
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
struct node {
long long p, q;
} a[50005];
int n, k;
long long m, ans;
priority_queue<long long, vector<long long>, greater<long long>> q;
int main() {
std::ios::sync_with_stdio(false);
cin >> n >> k >> m;
for (int i = 0; i < n; i++) {
cin >> a[i].p >> a[i].q;
}
sort(a, a + n, [](node a, node b) { return a.q < b.q; });
for (int i = 0; i < k; i++) {
ans += a[i].q;
q.push(a[i].p - a[i].q);
if (ans > m) {
cout << i << endl;
exit(0);
}
if (i == n - 1) {
cout << n << endl;
exit(0);
}
}
sort(a + k, a + n, [](node a, node b) { return a.p < b.p; });
for (int i = k; i < n; i++) {
auto t = q.top();
ans += a[i].p;
if (a[i].q + t < a[i].p) {
q.pop();
ans += t + a[i].q - a[i].p;
q.push(a[i].p - a[i].q);
}
if (ans > m) {
cout << i << endl;
exit(0);
}
}
cout << n << endl;
return 0;
}