#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 P = 998244353;
void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n), b(n), c, d;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    for (int i = 0; i < 2 * n; i++) {
        int f = i % 2;
        if (f == 0) {
            if (b.size() == 0) {
                c.push_back(a.back());
                a.pop_back();
            } else if (c.size() >= k || a.size() == 0) {
                b.pop_back();
            } else {
                if (a.back() == b.back()) {
                    b.pop_back();
                } else if (a.back() > b.back()) {
                    c.push_back(a.back());
                    a.pop_back();
                } else {
                    b.pop_back();
                }
            }
        } else {
            if (a.size() == 0) {
                d.push_back(b.back());
                b.pop_back();
            } else if (d.size() >= k || b.size() == 0) {
                a.pop_back();
            } else {
                if (a.back() == b.back()) {
                    d.push_back(b.back());
                    b.pop_back();
                } else if (a.back() < b.back()) {
                    d.push_back(b.back());
                    b.pop_back();
                } else {
                    a.pop_back();
                }
            }
        }
    }
    i64 ans = 0;
    for (int i = 0; i < min((int)c.size(), k); i++) ans += c[i];
    for (int i = 0; i < min((int)d.size(), k); i++) ans -= d[i];
    cout << ans << '\n';
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}