#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b) {
    int x = 1;
    a %= M;
    while (b) {
        if (b & 1) x = (x * a) % M; 
        a = (a * a) % M;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> b;

int consistency(int n, int x, int y){
    
    vector<int> dif(n);
    int sumb = 0;
    for(int i=0; i<n; i++){
        dif[i] = a[i]-b[i];
        sumb += b[i];
    }
    
    sort(begin(dif), end(dif), greater<int>());
    
    vector<int> prefixDif(n+1);
    for(int i=0; i<n; i++){
        prefixDif[i+1] = prefixDif[i] + dif[i];
    }
    
    int maxSum = 0;
    for(int i=1; i<=x; i++){
        int j = n-i;
        if(j>y) continue;
        int sum = sumb + prefixDif[i];
        maxSum = max(maxSum, sum);
    }

    return maxSum;    
}















int practice(int n, int x, int y){


    return 0;
}





void solve() {
    
    int n, x, y;
    cin>> n >> x >> y;
    
    a.resize(n);
    b.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> b[i];
    
    cout << consistency(n, x, y) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}