#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"

#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = l;x<u;x++)
#define RREP(x,l,u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) a.begin(),a.end()
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) ((x)&(-(x)))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define sz(x) ((int)x.size())
#define EX0 exit(0)

typedef  long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
typedef vector<ll> VLL;
typedef vector<int> VI;
const int block_size = 320;
typedef complex<ll> point;
const ll mod = 1e9 + 7;
const ll inf = 1e9 + 7;
const ll INF = 1e18 + 5;
const ld eps = 1e-9;
const db PI = atan(1) * 4;
template<typename T>
inline int sign(const T&a) {
	if (a < 0)return -1;
	if (a > 0)return 1;
	return 0;
}
string to_string(string s) {
	return '"' + s + '"';
}

string to_string(const char* s) {
	return to_string((string)s);
}

string to_string(bool b) {
	return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
	return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
	bool first = true;
	string res = "{";
	for (const auto &x : v) {
		if (!first) {
			res += ", ";
		}
		first = false;
		res += to_string(x);
	}
	res += "}";
	return res;
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	cerr << " " << to_string(H);
	debug_out(T...);
}

#ifndef ONLINE_JUDGE
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) {}
#endif

template<typename T, typename S>inline bool upmin(T&a, const S&b) { return a > b ? a = b, 1 : 0; }
template<typename T, typename S>inline bool upmax(T&a, const S&b) { return a < b ? a = b, 1 : 0; }

template<typename T> inline void in(T &x) {
	x = 0;
	T f = 1;
	char ch = getchar();
	while (!isdigit(ch)) {
		if (ch == '-') f = -1;
		ch = getchar();
	}
	while (isdigit(ch)) {
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	x *= f;
}

ll twop(int x) {
	return 1LL << x;
}

template<typename A, typename B > inline void in(A&x, B&y) {
	in(x);
	in(y);
}
template<typename A, typename B, typename C>inline void in(A&x, B&y, C&z) {
	in(x);
	in(y);
	in(z);
}
template<typename A, typename B, typename C, typename D> inline void in(A&x, B&y, C&z, D&d) {
	in(x);
	in(y);
	in(z);
	in(d);
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a%b); }

namespace SOLVE {
	struct fenwick { // this fenwick tree keeps maximum prefix
		int maxn; // inclusive
		VLL A; // 1-indexed! 

		void build(int n) {
			maxn = n;
			A.resize(n + 1, 0);
		}

		void update(int x, ll v) {
			if (x > maxn) {
				return;
			}
			A[x] = max(A[x], v);
			int next = x + (x & -x);
			update(next, v);
		}

		ll query(int x) {
			if (x == 0) {
				return 0;
			}
			int next = x - (x & -x);
			return max(A[x], query(next));
		}
	};

	void main() {
		int n;
		cin >> n;
		VLL height(n);
		VLL beauty(n);
		fenwick tree;
		tree.build(n + 1); // maximum height is n+1

		REP(i, 0, n) {
			cin >> height[i];
		}
		REP(i, 0, n) {
			cin >> beauty[i];
		}

		for (int flower = 0; flower < n; flower++) {
			// choose the best beauty of a flower that has height less than current height

			// grab the maximum 
			ll biggest = tree.query(height[flower] - 1);
			// update the tree at that position
			tree.update(height[flower], biggest + beauty[flower]);
		}

		ll ans = tree.query(n + 1);

		cout << ans << endl;




	}
}


signed main() {

	int t;
	//    in(t);
	t = 1;
	while (t--) {
		SOLVE::main();

	}















	return 0;
}


Measured memory_bytes: 4992