#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long,long>
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define REPI(i,a,b) for(ll i=b-1;i>=a;i--)
#define ff first
#define ss second
#define pb push_back
#define db pop_back
#define mp make_pair
#define mt make_tuple
#define g(a,b) get<a>(b)
#define INF (ll)1e18+100
#define vl vector<ll>
#define vi vector<int>
#define vll vector<pair<ll,ll> >
#define vii vector<pair<int, int> >
 
#define o_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define o_setll tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
//member functions :
//1. order_of_key(k) : number of elements strictly lesser than k
//2. find_by_order(k) : k-th element in the set
 
/*ll modI(ll a, ll m);
ll gcd(ll a, ll b);
ll powM(ll x, unsigned ll y, unsigned ll m);
void pairsort(int a[], int b[], int n);
void pairsortll(ll a[],ll b[],ll n);
ll logint(ll x,ll y);
 
 
ll gcd(ll x,ll y)
{
    if(x==0) return y;
    return gcd(y%x,x);
}
 
ll powM(ll x,ll y,ll m)
{
    if(y==0) return 1;
    ll p=powM(x,y/2,m)%m;
    p=(p*p)%m;
    return (y%2==0)?p:(x*p)%m;
}
 
ll modI(ll a, ll m)
{
   return powM(a, m-2, m);
}
 
void pairsort(int a[],int b[],int n)
{
    pair<int,int> v[n];
    REP(i,0,n)
    {
        v[i].ff=a[i];
        v[i].ss=b[i];
    }
    sort(v,v+n);
    REP(i,0,n)
    {
        a[i]=v[i].ff;
        b[i]=v[i].ss;
    }
}
 
void pairsortll(ll a[],ll b[],ll n)
{
    pair<ll,ll> v[n];
    REP(i,0,n)
    {
        v[i].ff=a[i];
        v[i].ss=b[i];
    }
    sort(v,v+n);
    REP(i,0,n)
    {
        a[i]=v[i].ff;
        b[i]=v[i].ss;
    }
}
 
ll logint(ll x,ll y)
{
    ll ans=0;
    ll a=1;
    for(ll i=0;i<=x;i++)
    {
        if(x<a)
        {
            return ans;
        }
        ans++;
        a*=y;
    }
    return -1;
}*/
const int N = 2e5+5;
ll n;
vl a, h;
ll ans=0;
ll seg[4*N];
ll query(ll l, ll r, ll v, ll ql, ll qr){
    if(ql > r || qr < l){
        return 0;
    }
    if(ql <= l && qr >= r){
        return seg[v];
    }
    ll mid = (l+r)/2;
    return max(query(l, mid, 2*v, ql, qr), query(mid+1, r, 2*v+1, ql , qr));
}
void update(ll l, ll r, ll v, ll pos, ll val){
    if(l == r){
        seg[v]=max(seg[v], val);
        return;
    }
    ll mid = (l+r)/2;
    if(pos <= mid){
        update(l, mid, 2*v, pos, val);
    }
    else{
        update(mid+1, r, 2*v+1, pos, val);
    }
    seg[v] = max(seg[2*v], seg[2*v+1]);
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    //Hey, You
    // Don't practise these
    // easy questions.
    cin>>n;
    REP(i, 1, n+1){
        ll x;
        cin>>x;
        h.pb(x);
    }
    REP(i, 1, n+1){
        ll x;
        cin>>x;
        a.pb(x);
    }
    
   // build(1,n,1);
    //dp.insert({h[0],a[0]});
    //ans = max(ans, a[0]);
    REP(i, 0, n){
        ll z = query(1, n, 1, 1,h[i]-1);
        ans = max(ans, z+a[i]);
        update(1,n,1,h[i], z+a[i]);
    }
    cout<<ans;
}

Measured memory_bytes: 9584