#pragma GCC optimize("Ofast")
#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;


/*
           1) long long vs int overflow
           2) read question carefully
*/

#define eprintf(...)   fprintf(stderr, __VA_ARGS__)
#define umapii unordered_map < int , int >
#define umapll unordered_map<ll,ll>
#define mapll map<ll,ll>
#define mapii map<int,int>
#define ll long long
#define pi pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vs vector<string>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pi>
#define vpll vector<pll>
#define vvi vector<vi>
#define vvll vector<vll>
#define all(v) (v).begin(),(v).end()
#define FOR(i,a,b) for(int i = a;i <= b; i++)

#define debug(x)       cerr<< #x <<" : "<< x << endl;
#define debuga(A,N)    cerr<< #A <<" : [";for(int i = 0; i<N;i++) cerr<<A[i]<<" "; cerr<<"]\n";
#define debuga2(A,N,M) cerr<< #A << " : \n"; for(int i=0;i<N;i++){cerr<<"[";for(int j=0;j<M;++j) cerr<<A[i][j]<<" ";cerr<<"]\n";}
#define debugp(p)      cerr<< #p <<" : "<<"("<<(p).first<<","<<(p).second<<")\n";
#define debugv(v)      cerr<< #v <<" : "<<"[";for(int i = 0; i< (v).size(); i++) cerr<<v[i]<<" "; cerr<<"]\n";
#define debugv2(v)     cerr<< #v << " : \n"; for(int i=0;i<v.size();i++){cerr<<"[";for(int j=0;j<(v[0].size());++j) cerr<<v[i][j]<<" ";cerr<<"]\n";}
#define debugs(m)      cerr<< #m <<" : [ "; for(auto itr = m.begin(); itr!=m.end();itr++) cerr<<*itr<<" "; cerr<<"]\n";
#define debugm(m)      cerr<< #m <<" : [ "; for(auto itr = m.begin();itr!=m.end(); itr++) cerr<<"("<<itr->first<<","<<itr->second<<") ";cerr<<"]\n";

const ll mod = 1000000007;

/*
(**) setting precision for cout :(print ans with precision upto 10 decimal places) 
            cout << setprecision(10) << ans << '\n';


STL:
       (1) PRIORITY_QUEUE pq:
       -> priority_queue < int > pq; // max_heap
       -> priority_queue < int , vector < int > , greater < int > > pq; // min_heap 
       -> pq.top()   --> returns the maximum or minimum element
       -> pq.push()  --> push element into the queue
       -> pq.pop()   --> remove top most element
       -> pq.empty() --> checks whether queue is empty or not
     
      (2) map:
      -> map <int, int> mp;
      -> mp.count(key) --> check the presence in a map
      -> mp.find(key) == mp.end() --> check presence in a map
      -> mp.erase(iterator) --> deletes iterator from map..don't directly pass in key here

*/
ll modexp(ll x, ll ex) {
    ll ans = 1ll;
    while (ex > 0) {
        if (ex & 1ll) ans = (ans * x) % mod;
        ex >>= 1ll;
        x = (x * x) % mod;
    }
    return ans;
}
template <typename T>
class fenwick{
    public:
     vector<T> BIT;
     int N;
     void init(int size){ 
         BIT.resize(size + 1);
         fill(BIT.begin() , BIT.end() , 0);
         N = size + 1;
     }
     void modify(int x , T val){ 
           while(x < N){
               BIT[x] = max(BIT[x] , val);
               x += (x & (-x));
           }
     }
     T get(T x){
          T mx = 0;
          while(x > 0){
              mx = max(mx , BIT[x]);
              x -= (x & (-x));
          }
          return mx;
     }
};
const int inf = 1e9 + 7;

int main(){
    ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    vll h(n + 1), b(n + 1);
    FOR(i, 1, n){
        cin >> h[i];
    }
    FOR(j, 1, n){
        cin >> b[j];
    }
    vll dp(n + 1);
    fenwick<ll> fenw;
    fenw.init(n + 1);  
    dp[1] = b[1];
    fenw.modify(h[1] , dp[1]);
    for(int i = 2; i <= n; i++){
        dp[i] = 1ll * fenw.get(h[i] - 1) + b[i];
        fenw.modify(h[i] , dp[i]);
    }
    ll ans = b[1];
    for(int i = 1; i <= n; i++){
        ans = max(ans , dp[i]);
    }
    cout << ans << '\n';
}

Measured memory_bytes: 6528