大样例过水

#include <bits/stdc++.h>
#define int long long
using namespace std;

int a[100005], b[100005], c[100005], sum[100005];
int n, m, ans;

signed main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        c[i] = a[i] + b[i];
    }
    sort(c + 1, c + 1 + n);
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
    for (int i = 0; i <= n; i++) {
        if (m >= sum[i]) ans = max(ans, i + ((m - sum[i]) / c[1]) * 2);
    }
    cout << ans << endl;
    return 0;
}