#include<iostream> #include<algorithm> #define ll long long using namespace std; ll n,m,ans=0,s[100005]; bool cmp(int x,int y){ return x>y; } int main(){ cin>>n>>m; for(int i=1;i<=n;i++){ ll a,b; cin>>a>>b; s[i]=a-b; ans+=a; } sort(s****+n+1,cmp); for(int i=1;i<=n;i++){ if(ans>m){ ans-=s[i]; } else{ cout<<i-1<<"\n"; return 0; } } cout<<"-1\n"; return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ int n,m; cin>>n>>m; priority_queue<int,vector<int>,less<int>> q; int cnt1=0,cnt2=0; for(int i=1;i<=n;i++){ int x,y; cin>>x>>y; cnt1+=x; cnt2+=y; q.push(x-y); } if(cnt2>m){ cout<<"-1"; return 0; } int cnt=0; while(cnt1>m && q.size()){ cnt1-=q.top(); q.top(); cnt++; } cout<<cnt; return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ priority_queue<int,vector<int>,less<int> > q; int n,m,sum=0,sum1=0; cin>>n>>m; for(int i=0;i<n;i++){ int x,y; cin>>x>>y; sum+=x; sum1+=y; q.push(x-y); } if(sum1>m){ cout<<-1; return 0; } int cnt=0; while(sum>m){ sum-=q.top(); q.pop(); cnt++; } cout<<cnt; return 0; }