#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace std;

/***** type *****/
using ll = long long;
using ld = long double;
using ml = boost::multiprecision::cpp_int;
using md = boost::multiprecision::cpp_dec_float_100;
using pll = pair<long, long>;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
template <class T> using uset = unordered_set<T>;
template <class T1, class T2> using umap = unordered_map<T1, T2>;

/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define coutld cout << fixed << setprecision(10) // cout long double
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define pair NyaaPair                            // nyaa pair
#define first f                                  // pair::first
#define second s                                 // pair::second
/***** const value *****/
#define llong_max 9223372036854775807            // 9 * 10^18
#define ldbl_max 1.79769e+308                    // 1.7 * 10^308
#define pi 3.1415926535897932                    // 3.14 ...
#define loop_end 9223372036854775806             // LLONG_MAX-1
/***** for each macro *****/
#define fori(i, ...) if(ll i = -1) for(__VA_ARGS__) if(i++, true)
#define each(i, e, c) fori(i, auto& e: c)
#define forir(i, v, ...) if(ll i=(ll)v.size())for(__VA_ARGS__)if(i--,true)
#define eachr(i, e, c) forir(i, auto e = c.rbegin(); e != c.rend(); ++e)

/***** lambda *****/
auto Count = [] // long long count value
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoL = [] // char to number
(auto c) { return (ll)(c - '0'); };
auto CeilD = [] // long double ceiling div
(auto a, auto b) { return ceil((ld)a / (ld)b); };
auto Fix = [] // fix value
(auto b, auto e, auto fix)
{ for (auto it = b; it != e; ++it) *it += fix; };
auto LtoC = [] // number to char
(auto n) { return (char)('0' + n); };
auto Pow = [] // long long pow
(auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
(auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
(auto n) { return (ll)pow(10, n); };
auto Size = []  // long long collection size
(auto& c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
(auto b, auto e) { return accumulate(b, e, 0LL); };

/***** template *****/
template <class T> void MakeVVT
(ll ys, ll xs, vvt<T>& v, T fill = T())
{	// vector<vector<T>> resize + fill
	v.resize(ys); rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T> void MakeVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fill = T())
{	// vector<vector<vector<T>>> resize + fill
	v.resize(zs); rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T> void InputVT
(ll xs, vt<T>& v, T fix = T())
{	// input vector<T> (T != struct) + fix
	v.resize(xs); rep(i, 0, xs) { cin >> v[i]; v[i] += fix; }
}
template <class T> void InputVVT
(ll ys, ll xs, vvt<T>& v, T fix = T())
{	// input vector<vector<T>> (T != struct) + fix
	MakeVVT(ys, xs, v, fix);
	rep(y, 0, ys) rep(x, 0, xs) { cin >> v[y][x]; v[y][x] += fix; }
}
template <class T> void InputVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fix = T())
{	// input vector<vector<vector<T>>> (T != struct) + fix
	v.resize(zs); rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}
template <class T1, class T2> struct NyaaPair
{	// nyaa pair template
	T1 f; T2 s;
};
template <class T1, class T2> bool
operator < (const NyaaPair<T1, T2>& l, const NyaaPair<T1, T2>& r)
{	// nyaa pair template operator <
	return (l.f != r.f) ? l.f < r.f : l.s < r.s;
}
template <class T1, class T2> bool
operator > (const NyaaPair<T1, T2>& l, const NyaaPair<T1, T2>& r)
{	// nyaa pair template operator >
	return (l.f != r.f) ? l.f > r.f : l.s > r.s;
}

/**************************************/
/********** BEGIN OF NYA LIB **********/
/**************************************/

namespace NyaGadget {}

namespace NyaGadget
{
	template <class T> struct SegmentTreeRMQ
	{
		long long n;
		vector<T> node;

		/**
		@brief コンストラクタ
		@param size データ構造最大値
		@note
		 半開区間[0, size)のデータ構造を作る。
		**/
		SegmentTreeRMQ(long long size)
		{
			n = 1;
			while (n < size) n *= 2;
			node.resize(2 * n - 1, 0);
		}

		/**
		@brief コンストラクタ
		@param v 初期値
		@note
		 初期値を配列で渡して同じサイズのデータ構造を作る。
		**/
		SegmentTreeRMQ(vector<T> v)
		{
			n = 1;
			while (n < (long long)v.size()) n *= 2;
			node.resize(2 * n - 1, 0);
			for (long long i = 0; i < (long long)v.size(); i++) node[i + n - 1] = v[i];
			for (long long i = n - 2; i >= 0; i--) node[i] = max(node[i * 2 + 1], node[i * 2 + 2]);
		}

		/**
		@brief 点加算関数
		@note
		 indexのデータにxを加算する。
		**/
		void Add(long long index, T x)
		{
			index += (n - 1);
			node[index] = x;
			while (index > 0)
			{
				index = (index - 1) / 2;
				node[index] = max(node[index * 2 + 1], node[index * 2 + 2]);
			}
		}

		/**
		@brief 区間最大値取得関数
		@note
		 閉区間[lindex, rindex)の最大値を取得する。
		**/
		T GetMax(long long lindex, long long rindex, long long k = 0, long long l = 0, long long r = -1)
		{
			if (r < 0) r = n;
			if (r <= lindex || rindex <= l) return 0;
			if (lindex <= l && r <= rindex) return node[k];
			T vl = GetMax(lindex, rindex, k * 2 + 1, l, (l + r) / 2);
			T vr = GetMax(lindex, rindex, k * 2 + 2, (l + r) / 2, r);
			return max(vl, vr);
		}
	};
}

/**************************************/
/*********** END OF NYA LIB ***********/
/**************************************/

using namespace NyaGadget;
//using mll = ModLL< 1000000007 >;
//using mll = ModLL< 998244353 >;

struct Nyaa
{
	ll h;
	ll a;
	ll i;
};

auto NyaaSort = [](const Nyaa& l, const Nyaa& r)
{	// 降順は演算子>, 昇順は演算子<, if順の優先でソートされる
	return l.h < r.h;
};

int main(void)
{
	ll N; cin >> N;
	vt<ll> h; InputVT(N, h);
	vt<ll> a; InputVT(N, a);

	vt<Nyaa> f;
	rep(i, 0, N) f.push_back({ h[i], a[i], i });
	sort(all(f), NyaaSort);

	SegmentTreeRMQ<ll> tree(N);
	each(i, e, f)
	{
		ll test = tree.GetMax(0, e.i);
		tree.Add(e.i, test + e.a);
	}

	cout << tree.GetMax(0, N);
	return 0;
}


Measured memory_bytes: 13548