75分求调

#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n, m, x, y, min_x_plus_y = INT64_MAX, min_x_plus_y_index = 0;
ll ans = 0, spent_money = 0;
int main() {
    cin >> n >> m;
    ll x_list[n] = {};
    for (ll i = 0; i < n; ++i) {
        cin >> x >> y;
        x_list[i] = x;
        if (min_x_plus_y > x + y) {
            min_x_plus_y = x + y;
            min_x_plus_y_index = i;
        }
    }
    const ll a = m / min_x_plus_y;
    ans += a * 2;
    spent_money += a * min_x_plus_y;
    sort(x_list, x_list + n);
    for (ll i = 0; i < n; ++i) {
        if (m - spent_money - x_list[i] >= 0) ++ans, spent_money += x_list[i];
        else break;
    }
    cout << ans << endl;
}