```cpp
#include<bits/stdc++.h>
using namespace std;
int n,a,b,s,ans=0;
struct aa
{
int high;
int power;
} f[5001] ;
bool operator < ( aa b,aa tmp)
{
return b.power<tmp.power;
}
int main()
{
cin>>n>>s;
cin>>a>>b;
for (int i=1;i<=n;i++)
{
scanf("%d%d",&f[i].high,&f[i].power);
}
sort(f+1,f+n+1);
int big=a+b;
for (int i=1;i<=n;i++)
{
if (s>=f[i].power && f[i].high<=big)
{
s=s-f[i].power;
ans++;
}
}
cout<<ans;
return 0;
}
```
by Stephzzz @ 2018-08-29 22:21:25
那个排序函数你怎么没用?
by Colin_Lovecraft @ 2018-08-30 08:13:07