全RE求调

P1478 陶陶摘苹果(升级版)

@[PAI0118](/user/374197) ``` #include<bits/stdc++.h> using namespace std; const int N=1e8+10; long long n,m,x,y,ans; struct Node{ int b,c; }a[N]; bool cmp(Node h,Node g){ return h.c <g.c ; } int main(){ cin>>n>>m; cin>>x>>y; for(int i=1;i<=n;i++){ cin>>a[i].b >>a[i].c ; } sort(a+1,a+1+n,cmp); int sum=x+y; for(int i=1;i<=n;i++){ if(a[i].b >sum){ continue; } if(a[i].b <=sum&&m>=a[i].c ){ ans++; m=m-a[i].c ; } } cout<<ans; }
by LoTLaneyyat @ 2023-12-04 13:48:13


|