Submission #1803531

---

Source Code Expand

#include <bits/stdc++.h>

#ifndef LOCAL
#define cerr dolor_sit_amet
#endif

#define mp make_pair
#define sz(x) ((int)((x).size()))
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair < int , int > ipair;
typedef pair < ll , ll > lpair;
const int IINF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const double DINF = numeric_limits<double>::infinity();
const int MOD = 1000000007;
const double EPS = 1e-9;
const int DX[] = { 1,  0, -1,  0,  1, -1,  1, -1};
const int DY[] = { 0,  1,  0, -1,  1, -1, -1,  1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll sqr(ll x) { return x*x; } ll sqr(int x) { return (ll)x*x; }
double sqr(double x) { return x*x; } ld sqr(ld x) { return x*x; }
mt19937 mmtw(960172);
ll rnd(ll x, ll y) { static uniform_int_distribution<ll> d; return d(mmtw) % (y - x + 1) + x; }

// ========================================================================= //

const int N = 5222;

struct Man {
    int h, p;
};
int n;
Man a[N];

int main() {
    ios::sync_with_stdio(false);

    cin >> n;
    for (int i = 0; i < n; ++i)
        cin >> a[i].h >> a[i].p;
    sort(a, a + n, [](Man const& x, Man const& y) {
        return x.h + x.p < y.h + y.p;
    });

    ll d[2][N];
    memset(d, 0x3f, sizeof(d));
    d[0][0] = 0;
    for (int i = 1; i <= n; ++i) {
        int i1 = i & 1;
        d[i1][0] = 0;
        for (int cnt = 1; cnt <= i; ++cnt) {
            d[i1][cnt] = d[i1^1][cnt];
            if (a[i-1].h >= d[i1^1][cnt-1])
                d[i1][cnt] = min(d[i1][cnt], d[i1^1][cnt-1] + a[i-1].p);
        }
    }
    
    int ans = 0;
    for (int i = 0; i <= n; ++i)
        if (d[n&1][i] < LINF)
            ans = i;
    cout << ans << "\n";

    return 0;
}

Submission Info

Judge Result