90pts WA on #15,#20

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;
ll n,m,mins=1e18+1,maxy=0,ans,now;
struct candy{
	ll x,y;
	bool f=0;
}can[100009];
bool cmp(candy a,candy b){
	return a.x<b.x;
} 
bool cmp1(candy a,candy b){
	return a.x+a.y<b.x+b.y;
}
bool cmp2(candy a,candy b){
	return a.y<b.y;
}
int main(){
	std::ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>can[i].x>>can[i].y;
		mins=min(mins,can[i].x+can[i].y);
	}
	//cout<<">>>>>S1<<<<<"<<endl;
	//cout<<"mins:"<<mins<<endl; 
	sort(can,can+n,cmp);
	int i=0;
	//cout<<">>>>>S2<<<<<"<<endl;
	while(can[i].x<=mins/2&&now+can[i].x<=m&&i<n){
		ans++;
		now+=can[i].x;
		can[i].f=1;
		//cout<<"i1:"<<can[i].x<<endl;
		i++;
	}
	int h=i;
	//cout<<"now:"<<now<<endl<<"ans:"<<ans<<endl;
	ans+=(m-now)/mins*2;
	//cout<<(m-now)<<' '<<(m-now)/mins<<endl;
	now+=((m-now)/mins)*mins;
	sort(can,can+n,cmp2);
	//cout<<"now:"<<now<<endl<<"ans:"<<ans<<endl;;
	i=0;
	//cout<<">>>>>S3<<<<<"<<endl;
	while(now<=m&&i<n&&now+can[i].y<=m){
		if(can[i].f){
			ans++;
			now+=can[i].y;
			//cout<<can[i].y<<endl;
		}i++;
	}
	while(can[h].x+now<=m&&h<n){
		if(can[h].f==0){
			now+=can[h].x;
			//cout<<ans<<endl;
			ans++;
			can[h].f=1;
		}h++;
	}
	cout<<ans;
	return 0;
}