为什么90WA#8？？？？玄关！！！！

#include<bits/stdc++.h>
using namespace std;
#define int long long
struct node{
    int a,b,c;
}a[500005];
bool cmp(node n,node m){
    return n.a<m.a;
}
signed main(){
    int n,m;
    cin>>n>>m;
    int minn=100000000000000,f=0;
    for(int i=1;i<=n;i++){
        cin>>a[i].a>>a[i].b;
        a[i].c=a[i].a+a[i].b;
        if(a[i].c<minn){
            minn=a[i].c;
            f=i;
        }
    }
    //sort(a+1,a+1+n,cmp);
    int k=(minn+1)/2;
    int ans=0;
    for(int i=1;i<=n;i++){
        if(a[i].a<=k&&f!=i){
            ans++;
            m-=a[i].a;
        }
    }
    //cout<<m<<" "<<ans<<" "<<a[f].a<<" "<<minn<<" ";
    if((m%minn)>=a[f].a){
        ans++;
    }
    cout<<ans+m/minn*2;
    return 0;
}