求hack

#include<bits/stdc++.h>
#define int long long 
using namespace std;
int n,m,ans;
struct node{
	int x,y;
}arr[100005];
bool cmp(node a,node b){
	return a.x<b.x;
}
signed main(){
	cin>>n>>m;
	int hjy=LONG_LONG_MAX;
	for(int i=1;i<=n;++i){
		cin>>arr[i].x>>arr[i].y;
		hjy=min(hjy,arr[i].x+arr[i].y);
		
	}
	sort(arr+1,arr+n+1,cmp);
	int maxx=0;
	
	for(int i=1;i<=n;++i){
		if(arr[i].x*2<hjy){
			if(m>=arr[i].x){
				ans++;
				m-=arr[i].x;
				maxx=max(maxx,arr[i].x);
				swap(arr[i].x,arr[i].y);
				
			}
		}
	}
	ans+=(m/hjy)*2;
	m%=hjy;
	
	for(int i=1;i<=n;++i){
		if(m>=arr[i].x){
			ans++;
			m-=arr[i].x;
			maxx=max(maxx,arr[i].x);
			swap(arr[i].x,arr[i].y);
		}
	}
	if(m+maxx>=hjy)ans++;
	cout<<ans;
}