#include #include #include #include #include #include #include #define rep(i, a, b) for (int i = int(a); i < int(b); i++) using namespace std; using ll = long long int; using P = pair; // clang-format off #ifdef _DEBUG_ #define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false) template void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; } #else #define dump(...) do{ } while(false) #endif template vector make_v(size_t a, T b) { return vector(a, b); } template auto make_v(size_t a, Ts... ts) { return vector(a, make_v(ts...)); } template bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; } template bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; } template void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; } template void input(Ts&... ts) { (cin >> ... >> ts); } template istream &operator,(istream &in, T &t) { return in >> t; } // clang-format on int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin, n; vector

v(n); rep(i, 0, n) { cin, v[i].first, v[i].second; } sort(v.begin(), v.end(), [](P &p1, P &p2) { return p1.first + p1.second < p2.first + p2.second; }); const ll inf = 1LL << 60; auto dp = make_v(n + 1, n + 1, inf); dp[0][0] = 0; rep(i, 0, n) { rep(j, 0, n + 1) { chmin(dp[i + 1][j], dp[i][j]); if (j < n && dp[i][j] <= v[i].second) { chmin(dp[i + 1][j + 1], dp[i][j] + v[i].first); } } } int ans = 0; rep(i, 0, n + 1) { if (dp[n][i] != inf) { chmax(ans, i); } } print(ans); return 0; }