蒟蒻求助，玄2关

#include<bits/stdc++.h>
using namespace std;
const int max_size=1e5+10;
long long n,m,ans,money,x[max_size],sum[max_size];
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        long long y;cin>>x[i]>>y;
        sum[i]=x[i]+y;
    }
    auto minn=min_element(sum+1,sum+1+n);
    ans=m/(*minn)*2;money=m%(*minn);
    sort(x+1,x+1+n);
    int cnt=1;
    while(true){
        money-=x[cnt];
        if(money>=0){
            ans++;cnt++;
        }else{
            break;
        }
    }
    cout<<ans;
	return 0;
}