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

 
typedef long long ll;
typedef long double ld;

ll n,k,l;

ll a[100005];
ll b[100005];

ll m_cnt;
map<ll,ll> m;

map<ll,ll> candidates;

ll sum_a;
ll sum_b;

void try_best_candidate(){
    if(candidates.size() == 0)return;
    ll best_candidate = candidates.rbegin()->first;

    // just insert any candidate
    if(m_cnt < l){
        m_cnt++;
        sum_b += best_candidate;
        m[best_candidate]++;
        candidates[best_candidate]--;
        if(candidates[best_candidate] == 0)candidates.erase(best_candidate);
        return;
    }

    // smallest map element (non empty map)
    ll smallest = m.begin()->first;
    if(best_candidate > smallest){
        m[best_candidate]++;
        m[smallest]--;
        candidates[smallest]++;
        candidates[best_candidate]--;
        sum_b -= smallest;
        sum_b += best_candidate;

        if(m[smallest] == 0)m.erase(smallest);
        if(candidates[best_candidate] == 0)candidates.erase(best_candidate);
        return;
    }
}



// g++ -std=c++11 main.cpp -o main && ./main
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    cin >> n;
    for(ll i=0;i<n;i++)cin>>a[i];
    for(ll i=0;i<n;i++)cin>>b[i];

    cin >> k >> l;

    // first k elements
    for(ll i=0;i<k;i++){
        sum_a += a[i];
        candidates[b[i]]++;
        try_best_candidate();
    }

    ll ans = sum_a + sum_b;

    for(ll i=0;i<k;i++){


        int old_pos = k-1-i;
        int new_pos = n-1-i;

        sum_a -= a[old_pos];
        sum_a += a[new_pos];
        // remove value from m or candidates
        {
            // if we even have old value in map
            if(m[ b[old_pos] ]){
                m[ b[old_pos] ]--;
                m_cnt--;
                sum_b -= b[old_pos];
                if(m[ b[old_pos] ] == 0){
                    m.erase( b[old_pos] );
                }
            // if not in value map it is in candidate map
            } else {
                candidates[ b[old_pos] ]--;
                if(candidates[ b[old_pos] ] == 0)candidates.erase( b[old_pos] );
            }
        }

        // add new value
        {
            candidates[ b[new_pos] ]++;
            try_best_candidate();
        }

        ans = max(ans, sum_a + sum_b);
    }


    cout << ans << endl;


    return 0;
}