今天带着大家看看 升级版的陶陶摘苹果:
AC:
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+3;
int n,s,a,b,m,c[maxn],ans;
int main(){
cin>>n>>s>>a>>b;
for (int i=1;i<=n;i++){
int x,y; cin >> x >> y;
if (x<=a+b) c[++m]=y;
}
sort(c+1,c+m+1);
for (int i=1;i<=m;i++){
if (s>=c[i]) s-=c[i],ans++;
}
cout << ans << endl;
}