#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int lli;
#define ff              first
#define ss              second
#define pb              push_back
#define mp              make_pair
#define pii             pair<lli,lli>
#define vi              vector<lli>
#define mii             map<lli,lli>
#define pqb             priority_queue<lli>
#define pqs             priority_queue<lli,vi,greater<lli> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            lli x; cin>>x; while(x--)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ONLINE_JUDGE
typedef tree<lli, null_type, less<lli>, rb_tree_tag, tree_order_statistics_node_update> pbds;


void zanj0()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}
bool cmp(pair <lli, lli>& a, pair <lli, lli>& b) {
    return abs(a.ff - a.ss)  >= abs(b.ff - b.ss);
}
void solve() {
    lli n, a, b;
    cin >> n >> a >> b;
    vector < pair <lli, lli> > v(n);
    for (lli i = 0; i < n; i++) {
        cin >> v[i].ff;
    }
    for (lli i = 0; i < n; i++) {
        cin >> v[i].ss;
    }
    lli ret = 0;
    sort(v.begin(), v.end(), cmp);
    for (lli i = 0; i < n; i++) {
        if (v[i].ff > v[i].ss && a > 0) {
            ret += v[i].ff;
            a--;
        } else if (v[i].ff < v[i].ss && b > 0) {
            ret += v[i].ss;
            b--;
        } else if (b > 0) {
            ret += v[i].ss;
            b--;
        } else if (a > 0) {
            ret += v[i].ff;
            a--;
        }
    }
    cout << ret << endl;
}
int main()
{
    zanj0();
    solve();
    return 0;
}