P1478 陶陶摘苹果(升级版)

就是结构体排个序再贪心

// Problem: P1478 陶陶摘苹果（升级版）
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P1478
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// Date: 2024-03-26 19:16:58
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define endl '\n'
#define int int64_t
#define ld long double
using namespace std;
int dx[] = { -1,0,1,0 };
int dy[] = { 0,1,0,-1 };
const int NC = 2e3 + 10;
char ches[NC][NC];
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
int a[N], b[N], s,n, m, k;
struct Node {
	int x, y;
	bool operator<(const Node& b)const{
		return y < b.y;
	}
}nd[N];
void solve() {
	cin >> n >> s;
	int ha, hb; cin >> ha >> hb;
	for (int i = 1; i <= n; ++i) {
		cin >> nd[i].x >> nd[i].y;
	}
	sort(nd + 1, nd + n + 1);
	int tot = 0;
	for (int i = 1; i <= n; ++i) {
		if (ha + hb >= nd[i].x && s >= nd[i].y) {
			s -= nd[i].y;
			tot++;
		}
	}
	cout << tot << endl;
}
signed main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}