求hack

#include<bits/stdc++.h>
using namespace std;
#define N 100005
#define int long long
struct node {
    int x, y;
} a[N];
int n, m, X = LLONG_MAX, ans;
int check(int x) {
    int res = m / X * 2, now = m % X;
    res -= x * 2;
    now += x * X;
    for (int i = 1; i <= n; i++) {
        if (a[i].x > now) break;
        now -= a[i].x;
        res++;
    }
    ans = max(ans, res);
    return res;
}
bool cmp(node a, node b) {
    return a.x < b.x;
}
signed main() {
    // freopen("candy.in", "r", stdin);
    // freopen("candy.out", "w", stdout);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].x >> a[i].y;
        X = min(X, a[i].x + a[i].y);
    }
    sort(a + 1, a + n + 1, cmp);
    check(0);
    int l = 1, r = m / X;
    while (l < r - 2) {
        int mid = (l + r) / 2;
        if (check(mid) > check(mid + 1)) l = mid;
        else r = mid + 1;
    }
    for (int i = l; i <= r; i++) check(i);
    cout << ans;
}