// UUID: 2dc5d497-c2aa-4857-a420-4da01ce60eb9
#include <bits/stdc++.h>
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.rbegin(), l.rend());

    int xp = 0, t = 0;
    int i = 0, j = n-1;
    //cout << "i" << " " << "j" << " " << "x" << " " << "jf" << " " << "is" << " " << "t" << "\n";
    while (i <= j) {
        //cout << i << " " << j << " " << xp << " " << l[j].first << "  " << l[i].second << "  " << t << " ";
        if (xp >= l[j].first) {
            //cout << 1 << "\n";
            xp += l[j].second;
            t += l[j].second;
            j--;
        }
        else if (xp + l[i].second > l[j].first) {
            //cout << 2 << "\n";
            t += 2 * (l[j].first - xp);
            l[i].second -= l[j].first - xp;
            xp = l[j].first;

            xp += l[j].second;
            t += l[j].second;
            j--;
        }
        else {
            xp += l[i].second;
            //cout << 3 << "\n";
            t += 2 * (l[i].second);
            i++;
        }
    }

    cout << t;
}