// UUID: df282961-b298-443a-a936-4e9ae8a2ef3e
#include <bits/stdc++.h>
#include <csetjmp>
using namespace std;

int main() {
	int n; cin >> n;
    vector<pair<int, int>> l(n);
    for (int i = 0; i < n; i++) {
        cin >> l[i].first;
    }
    for (int i = 0; i < n; i++) {
        cin >> l[i].second;
    }

    sort(l.begin(), l.end());

    int xp = 0, t = 0;
    int i = 0, j = n-1;
    while (i <= j) {
        if (xp >= l[i].first) {
            xp += l[i].second;
            t += l[i].second;
            i++;
        } else {
            int kell = l[i].first - xp;
            int vesz = min(kell, l[j].second);

            t += 2 * vesz;
            xp += vesz;
            l[j].second -= vesz;

            if (l[j].second == 0) j--;
        }
    }

    cout << t;
}