萌新求解！！！

#include<bits/stdc++.h>
using namespace std;

int n,s,a,b;
struct node{
	int x,y;
}apple[6000];

int cmp(node e,node h) {
	return e.y < h.y;
}

int main()
{
	cin >> n >> s;
	cin >> a >> b;
	for (int i = 1;i <= n;i++) {
		cin >> apple[i].x >> apple[i].y;
	}
	sort(apple + 1,apple + n + 1,cmp);
	int sum = 0;
	bool ans = 1;
	int i = 1;
	while (ans != 0 && i <= n){
		if (s >= apple[i].y && a + b >= apple[i].x) {
			s = s - apple[i].y;
			sum++;
			i++;
		}
		else{
			ans = 0;
		}
	}
	cout << sum;
	return 0;
}