0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-05 02:46:27 +00:00
OI-codes/S2OJ/636/636.cpp

51 lines
1.1 KiB
C++

#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;
}