NOIP 2025 游记

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10, INF = 2000000000;
int n, q[N], x, res = INF;
ll m;
int main()
{
    scanf("%d%lld", &n, &m);
    for(int i = 0; i < n; i ++) {
        scanf("%d%d", &q[i], &x);
        res = min(res, q[i] + x);
    }
    sort(q, q + n);
    ll ans = m / res * 2;
    for(int i = 0; i < n; i ++) {
        m -= q[i];
        if(m >= 0) ans = max(ans, i + 1 + m / res * 2);
        else break;
    }
    printf("%lld\n", ans);
    return 0;
}