the offical 数据 is made by feet

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+3,INF=0x3f3f3f3f;
int n,m,ans,x[N],y[N];
struct Node{
	int x,y,i;
}a[N];
inline bool cmp(Node x,Node y){
	return x.x<y.x;
}
main(){
//	freopen("candy6.in","r",stdin);
	cin >>n>>m;
	int ht=-1,maxh=INF,tt=-1;
	for(int i=0;i<n;i++){
		cin >>x[i]>>y[i];
		a[i].x=x[i],a[i].y=y[i],a[i].i=i;
		if(maxh>a[i].x+a[i].y)ht=i,maxh=a[i].x+a[i].y,tt=a[i].x;
	}
	sort(a,a+n,cmp);
	bool o=0;
	for(int i=0;i<n;i++){
		if(a[i].x>maxh/2.0)break;
		if(a[i].i==ht)o=1;
		ans++,m-=a[i].x;
	}
	int t=m/maxh;
	ans+=t*2;
	m-=t*maxh;
	if(o==1){
		if(m>=y[ht])ans++;
	}
	else {
		if(m>=x[ht])ans++;
	}
	cout <<ans;
	return 0;
}

hack:
2 16
3 6
4 10