#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; #define FOR(i, s, e) for (ll(i) = (s); (i) < (e); (i)++) #define FORR(i, s, e) for (ll(i) = (s); (i) > (e); (i)--) #define debug(x) cout << #x << ": " << x << endl #define mp make_pair #define pb push_back const ll MOD = 1000000007; const int INF = 1e9; const ll LINF = 1e16; const double PI = acos(-1.0); int dx[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int dy[8] = { 1, -1, 0, 0, 1, -1, 1, -1 }; /* ----- xtimex Problem: yukicoder054 / Link: http://yukicoder.me/problems/no/54 ----- */ /* ------問題------ -----問題ここまで----- */ /* -----解説等----- ----解説ここまで---- */ ll N; ll v[10100]; ll t[10100]; pll p[10100]; ll dp[30010]; ll ans = 0LL; int main() { cin.tie(0); ios_base::sync_with_stdio(false); cin >> N; FOR(i, 0, N) { cin >> v[i] >> t[i]; p[i] = mp(v[i] + t[i], i); } sort(p, p + N); dp[0] = 1; FOR(i, 0, N) { int s = p[i].second; FORR(j, t[s]-1, -1) { if (dp[j]) { dp[j + v[s]]++; } } } FOR(i, 0, 20000 + 1) { if (dp[i]) ans = max(ans, i); } cout << ans << endl; return 0; }