Submission #3765982

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define int long long
#define INF 1000000000000000000
using namespace std;

#define ANS(f) if(f) cout << "YES" << endl; else cout << "NO" << endl;

typedef vector<int> vec;
typedef vector<vec> mat;
typedef pair<int, int> Pii;

template<typename T>
void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }
void readi(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }
void debug(mat m){REP(i, m.size()){ REP(j, m[0].size()){ cout << m[i][j] << ","; } cout << endl; }}



signed main(){

    int N; cin >> N;
    vec H(N), P(N);
    vector<Pii> HP(N);
    REP(i, N){
        cin >> H[i] >> P[i];
        HP[i] = Pii(H[i] + P[i], i);
    }
    SORT(HP);

    vec dp(N + 1, INF);
    dp[0] = 0;
    REP(i, N){
        int i0 = HP[i].second;
        IREP(j, i + 1){
            if(dp[j] <= H[i0]) dp[j + 1] = min(dp[j + 1], dp[j] + P[i0]);
        }
    }
    int ans = 0;
    REP(i, N + 1) if(dp[i] < INF) ans = max(ans, i);
    cout << ans;
    
    return 0;
}

Submission Info

Judge Result