AcWing 4625. 压缩文件
原题链接
中等
作者:
Coinisi.
,
2023-01-11 09:11:08
,
所有人可见
,
阅读 161
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#define IOS std::ios::sync_with_stdio(false)
#define inf 0x3f3f3f3f
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define int long long
#define x first
#define y second
#define cmp [&](PII a, PII b){return a.y < b.y;}
const int N = 5e5+10, mod = 1e9+7, M = 5e7+5, K = 2e5+10, Z = 1e5+7;
using namespace std;
typedef long long LL;
typedef priority_queue<int> PQI;
typedef priority_queue <int, vector<int>, greater<>> PQGI;
typedef pair<int, int> PII;
int a[Z], b[Z], c[Z];
void solve()
{
int n, m, sum = 0; cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
cin >> a[i] >> b[i];
c[i] = a[i] - b[i], sum = sum + a[i];
}
sort(c + 1, c + 1 + n, greater<>());
for(int i = 0; i <= n; i ++)
{
sum = sum - c[i];
if(sum <= m)
{
cout << i << endl;
return;
}
}
cout << -1 << endl;
return;
}
signed main()
{
IOS; int T = 1;
cin.tie(nullptr);
cout.tie(nullptr);
// cin >> T;
while( T -- ) solve();
return 0;
}