求hack

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug() cerr<<"I Will AK\n"
#define N 200007
struct node{
	int a,b;
	bool operator<(const node &k)const{
		return a<k.a;
	}
}p[N];
int n,m;

signed main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n>>m;
	int mn=2e9;
	for(int i=1;i<=n;++i){
		cin>>p[i].a>>p[i].b;
		mn=min(mn,p[i].a+p[i].b);
	}
	int ans=(m/mn*2);
	sort(p+1,p+n+1);
	int sum=0;
	for(int i=1;i<=n;++i){
		sum+=p[i].a;
		if(m-sum<0) break;
		ans=max(ans,i+(m-sum)/mn*2);
	}
	cout<<ans;
	return 0;
}