求会挂多少分

#include <bits/stdc++.h>
using namespace std;
long long n,m,x,y,cnt;
long long summ = 1e10;
long long single[111111];
int main(){
    cin >> n >> m;
    for(int i = 1;i <= n;i++){
        cin >> x >> y;
        single[i] =  x;
        summ = min(summ,x+y);
    }
    sort(single+1,single+1+n);
    cnt += m/summ*2;
    m -= m/summ*summ;
    for(int i = 1;i <= n;i++){
        if(m >= single[i]){
            m -= single[i];
            cnt +=  1;
        }
        else{
            if(i == n){
                break;
            }
            else if(single[i] + single[i+1] <= summ){
                m += summ;
                cnt -= 2;
                m -= single[i];
                cnt += 1;
            }
            else{
                break;
            }
        }
    }
    cout << cnt << endl;
    return 0;
}

4 5
6 10
7 10
8 10
9 10

1

0