Submission #3043058

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
LP a[5000];
ll dp[5001][5001];
int main() {
	int n; cin >> n;
	rep(i, n) {
		ll h, p; cin >> h >> p;
		a[i] = { p,h };
	}
	sort(a, a + n);
	rep(i, 5001) {
		rep(j, 5001) {
			dp[i][j] = INF;
		}
	}
	dp[0][0] = 0;
	rep(i, n) {
		rep(j, n) {
			if (dp[i][j] == INF)continue;
			if (dp[i][j] <= a[i].second) {
				dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + a[i].first);
			}
			dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);
		}
	}
	int out = n;
	rep(j, n + 1) {
		if (dp[n][j] == INF) {
			out = j - 1; break;
		}
	}
	cout << out << endl;
	return 0;
}

Submission Info

Judge Result