#include #include #include using namespace std; #define INF 100000000 #define YJ 1145141919 #define INF_INT_MAX 2147483647 #define INF_LL_MAX 9223372036854775807 #define EPS 1e-10 #define MOD 1000000007 #define Pi acos(-1) #define LL long long #define ULL unsigned long long #define LD long double #define int long long const int MAX_N = 105; const int MAX_A = 1005; int N; int A[MAX_N], B[MAX_N]; int dp[MAX_N][MAX_N*MAX_A]; signed main() { cin >> N; for(int i = 0; i < N; i++) { cin >> A[i] >> B[i]; } for(int i = 0; i < MAX_N; i++) { for(int j = 0; j < MAX_N * MAX_A; j++) { dp[i][j] = INF; } } dp[0][0] = 0; for(int i = 0; i < N; i++) { for(int j = 0; j < MAX_N * MAX_A; j++) { if(dp[i][j] == INF) { continue; } dp[i+1][j + A[i]] = min(dp[i+1][j + A[i]], dp[i][j]); dp[i+1][j] = min(dp[i+1][j], dp[i][j] + B[i]); } } int ans = INF; for(int i = 0; i < MAX_N * MAX_A; i++) { if(dp[N][i] == INF) continue; ans = min(ans, max(i, dp[N][i])); } cout << ans << endl; return 0; }