80求条，尽力了

#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,m,sum,cnt,id,idx;
int a[100005];
int a1[100005];
int b[100005];
int nw[100005];
int minn=1000000005; 
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
      cin>>a[i]>>a1[i];
      nw[i]=a[i]+a1[i];
      if(minn>nw[i]){
        minn=nw[i];
        id=i;
      }
      if(minn==nw[i]&&a1[i]>a1[id]){
        id=i;
      }
    } 
    int po=a[id],xo=a1[id]-a[id];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
      if(a[i]==a[id]&&a[i+1]!=a[id]){
        idx=i;
      }
      a[i]+=a[i-1];

    }
    int op=m%minn;
    sum=m/minn*2;
    cnt=sum;
    for(int i=1;sum>=0;i++){
      int l=1,r=n;
      while(l<r){
        int mid=(l+r+1)>>1;
        if(a[mid]+(mid>=idx&&i%2==0)*xo>op){
          r=mid-1;
        }
        else{
          l=mid;
        }
      }
      if(a[l]+(l>=idx&&i%2==0)*xo<=op)
      cnt=max(cnt,sum+l);
      sum--;
      if(i%2){
        op+=a1[id];
      }
      else{
        op+=po;
      }
    }
    cout<<cnt;
    return 0;
}