#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]));} 
using tag=array<ll,3>;//(for 0,for 1,ou/ji) 
void operator +=(tag &x,const tag &y) {
    ll &op=x[2];
    x[0]+=y[op],x[1]+=y[op^1],op^=y[2];
}
tag operator +(tag x,const tag &y) {
    x+=y;return x;
}
void operator *=(info &x,const tag &y) {//only change the second
    x[0][0]+=y[0],x[1][0]+=y[0];
    x[0][1]+=y[1],x[1][1]+=y[1];
    if(y[2]) swap(x[0][0],x[0][1]),swap(x[1][0],x[1][1]);
}
info operator *(info x,const tag &y) {
    x*=y;return x;
}

int n;
const ll inf=1e18;
const int MAXN=2e5+50;

namespace sgt {
    #define ls (k<<1)
    #define rs (k<<1|1) 
    struct node {
        info pref;tag who;
        const node operator +(const node &rg) const {
            return (node){pref+rg.pref*who,rg.who+who};
        }
    } s[MAXN<<2];
    tag tg[MAXN<<2];//first //only change the first
    bool has[MAXN<<2];
    void init() {
        rep(k,1,(n+1)<<2) {
            for(int o:{0,1}) s[k].pref[o].fill(inf);
            s[k].pref[0][0]=0;//!
            s[k].who={0,0,0};
            tg[k]={0,0,0};
            has[k]=false;
        }
    }
    void upd(int k) {
        s[k]=s[ls]+s[rs];
    }
    void apply(int k,const tag &t) {//first 
        has[k]=true;
        auto &x=s[k].pref;
        x[0][0]+=t[0],x[0][1]+=t[0];
        x[1][0]+=t[1],x[1][1]+=t[1];
        if(t[2]) swap(x[0],x[1]);
        tg[k]+=t;
    }
    void push_down(int k) {
        if(has[k])
        apply(ls,tg[k]),apply(rs,tg[k]),tg[k].fill(0),has[k]=false;
    } 
    void Chkpos(int k,int l,int r,int pos,const info &f) {
        if(l==r) {s[k].pref=f*s[k].who;return ;}
        push_down(k);int mid=l+r>>1;
        if(pos<=mid) Chkpos(ls,l,mid,pos,f);
        else Chkpos(rs,mid+1,r,pos,f);
        return upd(k);
    }
    void Inssec(int k,int l,int r,int pos,int val) {
        if(l==r) {
            s[k].who={val,0,1};//!!
            s[k].pref*=s[k].who;
            return ;
        }
        push_down(k);int mid=l+r>>1;
        if(pos<=mid) Inssec(ls,l,mid,pos,val);
        else Inssec(rs,mid+1,r,pos,val);
        return upd(k); 
    }
    void Modify(int k,int l,int r,int x,int y,int val) {
        if(l>=x&&r<=y) return apply(k,{val,0,1});
        push_down(k);int mid=l+r>>1;
        if(x<=mid) Modify(ls,l,mid,x,y,val);
        if(y>=mid+1) Modify(rs,mid+1,r,x,y,val);
        return upd(k);
    }
    node Query(int k,int l,int r,int x,int y) {
        if(l>=x&&r<=y) return s[k];
        push_down(k);int mid=l+r>>1;
        if(y<=mid) return Query(ls,l,mid,x,y);
        if(x>=mid+1) return Query(rs,mid+1,r,x,y);
        return Query(ls,l,mid,x,y)+Query(rs,mid+1,r,x,y);
    }
    void chk(int pos,const info &f) {
        Chkpos(1,1,n+1,pos,f);
    }
    void ins(int pos,int val) {
        Inssec(1,1,n+1,pos,val);
    }
    void mdf(int l,int r,int val) {
        Modify(1,1,n+1,l,r,val);
    }
    info qry(int l,int r) {
        return Query(1,1,n+1,l,r).pref;
    }
    #undef ls 
    #undef rs
};

pi a[MAXN];

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;

    sgt::init();
    dec(id,n,1) {
        int pos=rk[id];
        int nxt=(id>1)?rk[id-1]:1;
        sgt::mdf(1,pos,a[id].fi);
        
        sgt::ins(pos+1,a[id].se);
        sgt::chk(nxt,sgt::qry(nxt+1,n+1));
    }
    ll ans=getmin(sgt::qry(1,1));
    printf("%lld",ans);
}
int main() {
    open_file
    solve();
    return 0;
}