// 基本テンプレート #include <iostream> #include <iomanip> #include <cstdio> #include <string> #include <cstring> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <utility> #include <algorithm> #include <map> #include <set> #include <complex> #include <cmath> #include <limits> #include <cfloat> #include <climits> #include <ctime> #include <cassert> #include <numeric> #include <fstream> #include <functional> using namespace std; #define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++) #define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++) #define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--) #define debug(...) fprintf(stderr, __VA_ARGS__) #define int long long int template<typename T> void chmax(T &a, T b) {a = max(a, b);} template<typename T> void chmin(T &a, T b) {a = min(a, b);} template<typename T> void chadd(T &a, T b) {a = a + b;} typedef pair<int, int> pii; typedef long long ll; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; const ll INF = 1001001001001001LL; const ll MOD = 1000000007LL; int dp[2][100010]; signed main() { int N; cin >> N; for(int i=0; i<2; i++) { for(int j=0; j<100010; j++) { dp[i][j] = INF; } } dp[0][0] = 0; for(int i=0; i<N; i++) { int A, B; cin >> A >> B; int cur = i % 2, nxt = 1 - cur; for(int j=0; j<100000; j++) { if(dp[cur][j] == INF) continue; // printf("j = %d\n", j); // solve A chmin(dp[nxt][j + A], dp[cur][j]); // solve B chmin(dp[nxt][j], dp[cur][j] + B); dp[cur][j] = INF; } } int ans = INF; for(int i=0; i<100010; i++) { if(dp[N%2][i] == INF) continue; chmin(ans, max(dp[N%2][i], i)); } cout << ans << endl; return 0; }