刷水题蜜汁RE

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct data
{
    int hight;
    int powr;
}app[5024];
int n,s,a,b;
int ans,ss;
int com(data xx,data yy)
{
    return xx.powr<=yy.powr;
}
int main()
{
    freopen("1478.in","r",stdin);
    freopen("1478.out","w",stdout);
    ans=0;
    ss=0;
    scanf("%d%d",&n,&s);
    scanf("%d%d",&a,&b);
    for(int i=1;i<=n;i++) scanf("%d%d",&app[i].hight,&app[i].powr);
    sort(app+1,app+1+n,com);
    cout<<"~"<<endl;
    for(int i=1;i<=n;i++)
    {
        if(s>=ss+app[i].powr && a+b>=app[i].hight)
        {
            ss+=app[i].powr;
            ans++;
        }
    }
    printf("%d\n",ans);
    return 0;
}