//https://qoj.ac/contest/1019/problem/4931

#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int maxn = 1e3 + 7;
int T = 1, n, m;
int dp[maxn][maxn * 10][2];
int a[maxn], b[maxn];

void solve(){
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) cin >> b[i];
    memset(dp, 0x3f, sizeof dp);
    dp[0][0][0] = 0ll;
    int sumb = 0;
    for(int i = 1; i <= n; i++) {
        sumb += b[i];
        for(int j = 0; j <= sumb; j++) {
            if(j >= b[i]) dp[i][j][1] = max(min(dp[i - 1][j - b[i]][1], dp[i - 1][j - b[i]][0]), j) + a[i];
            dp[i][j][0] = dp[i - 1][j][1] + a[i];
        }
    }
    int ans = inf;
    for(int i = b[i]; i <= n * 10; i++) ans = min(ans, dp[n][i][1]);
    cout << ans << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
 
    // cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}