95分，WA#18，求调

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF=1e5+10;
struct sss{
	int x;
	int y;
	int sum;
}a[INF];
bool tmp(sss x,sss y){
	return x.x<y.x;
}
signed main(){
	int n,m,cnt=0x3f3f3f3f3f3f3f3f,ans=0,val;
	cin>>n>>m;
	int u1=0;
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
		a[i].sum=a[i].x+a[i].y;
	}
	int u=1;
	sort(a+1,a+n+1,tmp);
	for(int i=1;i<=n;i++){
		if(cnt>a[i].sum){
			cnt=a[i].sum;
			u1=i;
		}
	}
	if(cnt%2==0){
		val=cnt/2;
	}else{
		val=cnt/2+1;
	}
	bool ff=0;
	for(int i=1;i<=n;i++){
		if(i==u1){
			ff=1;
			continue;
		}
		if(a[i].x<val){
			m-=a[i].x;
			ans++;
		}else{
			if(ff==1) u=u1;
			else u=i;
			break;
		}
	}
	ans+=(m/cnt)*2;
	m-=((m/cnt)*cnt);
	for(int i=u;i<=n;i++){
		if(a[i].x<=m){
			m-=a[i].x;
			ans++;
		}else{
			break;
		}
	}
	cout<<ans;
	return 0;
}