建议降红

合着这升级了但没完全升级是吧喵（无语

#include <bits/stdc++.h>
using namespace std;
struct Apple {
    int x, y;
}p;
struct cmp{
    bool operator()(Apple a, Apple b)
    {
        return a.y > b.y;
    }
};
priority_queue <Apple, vector<Apple>, cmp> q;
int s, a, b, n, ans, h;
int main()
{
    cin >> n >> s;
    cin >> a >> b;
    h = a + b;
    for (int i = 1; i <= n; i++)
    {
        cin >> p.x >> p.y;
        q.push(p);

    }
    while (!q.empty() && s >= 0)
    {
        if (q.top().x <= h && q.top().y <= s)
        {
            ans++;
            s -= q.top().y; 
        }
        q.pop();
    }
    cout << ans;
    return 0;
}