#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);++i) 
#define dec(i,a,b) for(int i=(a);i>=(b);--i) 
using ll=long long;
using pi=pair<int,int>;
using vi=vector<int>;
using vp=vector<pi>;
template<class T> bool chkmin(T &x,T y) {return (y<x)?(x=y,true):false;}
template<class T> bool chkmax(T &x,T y) {return (y>x)?(x=y,true):false;}
#define pb push_back
#define SZ(x) int(x.size())
#define fi first
#define se second
#define LOCAL 0
#define open_file if(LOCAL) {freopen("a.in","r",stdin);freopen("a.out","w",stdout);}
int read() {int x;scanf("%d",&x);return x;}

using info=array<array<ll,2>,2>;
void operator +=(info &x,const info &y) {
    rep(i,0,1) rep(j,0,1) chkmin(x[i][j],y[i][j]);
}
info operator +(info x,const info &y) {
    x+=y;return x;
}
ll getmin(const info &x) {return min(min(x[0][0],x[0][1]),min(x[1][0],x[1][1]));} 
void add1(info &x,const ll val) {
    // swap(x[0],x[1]);
    x[0][0]+=val,x[0][1]+=val;
    swap(x[0],x[1]);
}
void add2(info &x,const ll val) {
    x[0][0]+=val,x[1][0]+=val;
    swap(x[0][0],x[0][1]),swap(x[1][0],x[1][1]);
}

const int MAXN=2e5+50;
info dp[MAXN];
pi a[MAXN];
int n;
int sa[MAXN],rk[MAXN];

void solve() {
    n=read();
    rep(i,1,n) a[i].fi=read();
    rep(i,1,n) a[i].se=read();
    sort(a+1,a+1+n);
    rep(i,1,n) sa[i]=i;sort(sa+1,sa+1+n,[&](auto i,auto j){return a[i].se<a[j].se;});
    rep(i,1,n) rk[sa[i]]=i;
    memset(dp,60,sizeof(dp));
    rep(i,1,n+1) dp[i][0][0]=0;
    dec(id,n,1) {
        int pos=rk[id];
        int lval=a[id].se,rval=a[id].fi;
        //left::sec right:fir
        rep(i,pos+1,n+1) dp[pos]+=dp[i];
        rep(i,1,pos) add2(dp[i],lval);
        rep(i,pos+1,n+1) add1(dp[i],rval);
    }
    ll ans=1e18;
    rep(i,1,n+1) chkmin(ans,getmin(dp[i]));
    printf("%lld",ans);
}
int main() {
    open_file
    solve();
    return 0;
}