#include <vector>
#include <string>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <bitset>
#include <stack>
#include <list>
#include <numeric>
#include <algorithm>
#include <random>
#include <chrono>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <climits>
#include <cctype>
#include <cmath>
#include <ctime>
#include <cassert>
using namespace std;
#define ULL unsigned long long
#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VLL vector <LL>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >
#define SI set < int >
#define USI unordered_set <int>
#define MII map <int, int>
#define UMII unordered_map <int, int>
#define MS multiset
#define US unordered_set
#define UM unordered_map
#define UMS unordered_multiset
#define UMM unordered_multimap
#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define SZ size()
#define BG begin()
#define EN end()
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()
#define INS insert
#define ER erase
#define CNT count
int n;
VPII a;
int main()
{
cin >> n;
a.RS(n + 1);
FOR(i, 1, n) cin >> a[i].X;
FOR(i, 1, n) cin >> a[i].Y;
sort(a.BG + 1, a.EN);
ULL experience = 0, time = 0;
int j = n;
while (j > 1 && experience < a[1].X)
{
if (experience + a[j].Y < a[1].X)
{
time += a[j].Y * 2;
experience += a[j].Y;
a[j].Y = 0;
}
else
{
time += (a[1].X - experience) * 2;
a[j].Y -= (a[1].X - experience);
experience = a[1].X;
}
--j;
}
FOR(i, 1, n)
{
if (a[i].X > experience)
if (experience + a[i].Y <= a[i].X) time += a[i].Y * 2;
else time += (a[i].X - experience) * 2 + a[i].Y - (a[i].X - experience);
else time += a[i].Y;
experience += a[i].Y;
}
cout << time;
return 0;
}