Submission #3767889

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
#define REP(i, x, y) for(ll i = x; i < y; i++)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-11;

ll dp[5010][5010];

int main() {
    ll N;
    cin >> N;
    tiii T[N];
    REP(i, 0, N) {
        ll h, p;
        cin >> h >> p;
        T[i] = make_tuple(h + p, h, p);
    }
    sort(T, T + N);
    REP(i, 0, 5010) {
        fill(dp[i], dp[i] + 5010, inf);
    }
    dp[0][0] = 0;
    REP(i, 1, N + 1) {
        dp[i][0] = 0;
        REP(j, 1, i + 1) {
            dp[i][j] = dp[i - 1][j];
            if (get<1>(T[i - 1]) >= dp[i - 1][j - 1]) {
                dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + get<2>(T[i - 1]));
            }
        }
    }
    ll ans = 0;
    REP(i, 0, N + 2) {
        if (dp[N][i] == inf) {
            ans = i - 1;
            break;
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result