75pts求调

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m,t,v[100005],minv=INT_MAX;
struct node{
	int x,y;
}a[100005];
bool cmp(node p,node q){
	return p.x<q.x;
}
signed main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
		v[i]=a[i].x+a[i].y;
		minv=min(minv,v[i]);
	}
	sort(a+1,a+n+1,cmp);
	int ans=m/minv,lft;
	lft=m-minv*ans;
	ans*=2;
	int i=1;
	while(lft>=a[i].x){
		ans++;
		lft-=a[i].x;
		i++;
	}
	cout<<ans<<endl;
	return 0;
}