75分求调(ji qiu

#include<bits/stdc++.h>

#define ll long long

using namespace std;

const int MAXN=100010;

int n;
ll m;

int ans=0;

int total_min=INT_MAX;

struct candy{
	int x,y;
}a[MAXN];

bool cmp(candy s1,candy s2){
	return s1.x<s2.x;
}
/*
2 10
3 3
4 1
*/
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
		if(total_min>(a[i].x+a[i].y)){
			total_min=min(total_min,a[i].x+a[i].y);
		}
	}
	sort(a+1,a+1+n,cmp);
//	cout<<"ans:"<<ans<<endl; 
	ans+=m/total_min*2;
	m%=total_min;
	for(int i=1;i<=n;i++){
		if(m>=a[i].x){
			m-=a[i].x;
			ans++;
		}else break;
	}
	cout<<ans<<endl;
	return 0;
}