95分，WA#8,求调

#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=0x3f3f3f3f,val,ans=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
		a[i].sum=a[i].x+a[i].y;
		cnt=min(cnt,a[i].sum);
	}
	val=cnt/2;
	int u;
	sort(a+1,a+n+1,tmp);
	for(int i=1;i<=n;i++){
		if(a[i].x<val){
			m-=a[i].x;
			ans++;
		}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;
}