```cpp
#include<iostream>
using namespace std;
int n,s,a,b,ans=0,t1,t2;
int xi[5010],yi[5010];
int main() {
cin>>n>>s>>a>>b;
a+=b;
for(int i=1; i<=n; i++) {
cin>>xi[i]>>yi[i];
}
for(int i=1; i<n; i++) {
for(int j=i+1; j<=n; j++) {
if(yi[i]>yi[j]) {
t1=xi[i],t2=yi[i];
xi[i]=xi[j],yi[i]=yi[j];
xi[j]=t1,yi[j]=t2;
}
}
}
for(int i=1; i<=n; i++) {
if(xi[i]<=a&&yi[i]<=s) {
ans++;
s-=yi[i];
}
}
cout<<ans;
return 0;
}
```
@[Mr_chen](/space/show?uid=70723)
by 孤独を見守る @ 2018-09-01 23:08:23
@[Mr_chen](/space/show?uid=70723)
by 孤独を見守る @ 2018-09-01 23:10:55
# dp有吗
by somethingfornothing @ 2018-09-01 23:11:52
# @[AC无敌机](/space/show?uid=86489)
by somethingfornothing @ 2018-09-01 23:12:04
@[Mr_chen](/space/show?uid=70723) 用dp太麻烦，看看标签啊QAQ
by 孤独を見守る @ 2018-09-01 23:13:24
ok
by 孤独を見守る @ 2018-09-01 23:22:24