NOIP T1 求调/hack

#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
inline int read() {
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0'&&ch<='9') { x=(x<<3)+(x<<1)+(ch^48); ch=getchar(); }
	return x*f;
}
const int maxn=100010;
int v1[maxn],v2[maxn];
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int n=read(),m=read();
	for(int i=1;i<=n;i++) {
		int x=read(),y=read();
		v1[i]=x+y;
		v2[i]=x;
	}
	sort(v1+1,v1+n+1);
	sort(v2+1,v2+n+1);
	int ans1=0,ans2=0;
	ans1=m/v1[1];
	m%=v1[1];
	int val1=0,val2=0,lst=0;
	for(int i=1;i<=n;i++) {
		if(m>v2[i]) {
			m-=v2[i];
			ans2++;
		}
		else if(m==v2[i]) {
			m-=v2[i];
			ans2++;
			break;
		}
		else {
			if(val1==0) val1=v2[i];
			else if(val2==0) val2=v2[i];
			if(val1>0&&val2>0) {
				if(val1+val2<v1[1]&&ans1>0) {
					m+=v1[1];
					ans1-=1;
					m-=val1+val2;
					ans2+=2;
					val1=0,val2=0;
				}
				else break;
			}
		}
	}
	int ans=2*ans1+ans2;
	cout<<ans<<endl;
	return 0;
}