求错，在线等

#include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int n,s,a,b,cnt=0;
    cin>>n>>s>>a>>b;
    int high[n],liqi[n];
    for(int i=0;i<n;i++){
        cin>>high[i]>>liqi[i]; 
    }
    sort(liqi,liqi+n);
    for(int i=0;;i++){
        if(s<liqi[i])break;
        else if(high[i]<=a+b&&s>=liqi[i]){
            cnt++;
            s-=liqi[i];
        }
    }
    cout<<cnt;
    return 0;
}