60分(3和5RE求调)

#include<bits/stdc++.h>  
using namespace std;  
struct apple{  
    int x,y;  
}awa[5005];  
int n,s,a,b;  
bool cmp(apple a,apple b){  
      return a.y<=b.y;  
}  
int main(){  
    cin>>n>>s>>a>>b;  
    for(int i=1;i<=n;i++){  
        cin>>awa[i].x>>awa[i].y;
    }
    sort(awa+1,awa+n+1,cmp);
    int sum=a+b,t=s;
    int cnt=0;
    for(int i=1;i<=n;i++){
        if(awa[i].x<=sum&&t-awa[i].y>=0){
            cnt++;
            t-=awa[i].y;
        }
        if(t-awa[i].y<0)break;
    }
    cout<<cnt;
    return 0;
}