#include <bits/stdc++.h>

using namespace std;

struct mineral{
long long needed;
long long lvl;
};

bool sortby(mineral a, mineral b)
{
    return a.lvl>b.lvl;
}

int main()
{
    cin.tie(0);
    long long time =0;
    iostream::sync_with_stdio(0);
    long long n;
    cin >> n;
    vector<mineral> items(n);
    for(int i = 0; i < n; i++)
    {
        cin >> items[i].lvl;
    }
    for(int i = 0; i < n; i++)
    {
        cin >> items[i].needed;
    }
    sort(items.begin(),items.end(),sortby);
    //for(auto x:items)cout << x.lvl <<" " << x.needed <<endl;
    long long cv = 0;
    long long currlvl=0;
    long long dif;
    long long last = n-1;
    while(cv < n)
    {
        dif = items[last].lvl - currlvl;
        if(dif<=0)
        {
            time += items[last].needed;
            currlvl += items[last].needed;
            items[last].needed=0;
            last--;
        }
        else{
        //cout << items[cv].needed <<" " <<dif << endl;
        if(items[cv].needed == 0)
        {
            cv++;
        }
        else
        {
            //for(int j=0;j<min(dif,items[cv].needed);j++)
                //{
                    items[cv].needed--;
                    time+=2;
                    //cout << "ketszer"<<endl;
                    currlvl++;
                //}
        }
        }
    }
    //for(auto x:items)cout << x.lvl <<" " << x.needed <<endl;
    cout << time;
}