#include <bits/stdc++.h>
using namespace std;

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;

void insert(multiset<ll>& ms, multiset<ll>& sec, ll& fl, ll val, int l)
{
	//val *= -1;
	if (sz(ms) < l)
	{
		ms.insert(val);
		fl += val;
	}
	else
	{
		ll las = *(ms.begin());
		if (las >= val)
		{
			sec.insert(val);
		}
		else
		{
			fl -= las;
			fl += val;
			ms.erase(ms.begin());
			ms.insert(val);
			sec.insert(las);
		}
	}
}

void erase(multiset<ll>& ms, multiset<ll>& sec, ll& fl, ll val, int l)
{
	if (ms.find(val) != ms.end())
	{
		ll las = *(sec.rbegin());
		fl += las;
		fl -= val;
		sec.erase(prev(sec.end()));
		ms.erase(ms.find(val));
		ms.insert(las);
	}
	else
		sec.erase(sec.find(val));
}

int solve()
{
	int n, k, l;
	if (!(cin >> n))
		return 1;
	
	vector<ll> a(n), b(n);
	FOR (i, 0, n)
		cin >> a[i];
	FOR (i, 0, n)
		cin >> b[i];
	cin >> k >> l;
	
	ll sm = 0, fl = 0;
	ll ans = 0;
	multiset<ll> ms, sec;
	FOR (i, 0, k)
	{
		sm += a[i];
		insert(ms, sec, fl, b[i], l);
	}
	
	ans = sm + fl;
	//cerr << "sm = " << sm << " fl = " << fl << '\n';
	int j = 0;
	int idx = k - 1;
	FOR (ii, 0, k)
	{
		int i = n - ii - 1;
		sm -= a[idx];
		insert(ms, sec, fl, b[n - 1 - j], l);
		erase(ms, sec, fl, b[idx], l);
		sm += a[n - 1 - j];
		j++;
		idx--;
		//cerr << "i = " << i << " sm = " << sm << " fl = " << fl << '\n';
		ans = max(ans, sm + fl);
	}
	cout << ans << '\n';
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1e9;
	//cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}