#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PII;
const int N = 1e5 + 10,mod = 998244353;

ll n,k,a[N],b[N],ca[13],cb[13];
ll dfs(ll i,ll j,ll ai,ll bj,ll h){
    ll temp;
    if(h == 2 * n){
        ll ta = 0;
        for(int l = 1;l <= k;l++){
            ta += ca[l] - cb[l];
            // cout << ca[l] << " " << cb[l] << "\n";
        }
        // cout << "\n";
        return ta;
    }
    if(h & 1LL){ //b;
        if(i <= n)
            temp = dfs(i + 1,j,ai,bj,h + 1);
        if(bj < k && j <= n){
            cb[bj + 1] = b[j];
            if(i <= n) temp = min(temp,dfs(i,j + 1,ai,bj + 1,h + 1));
            else temp = dfs(i,j + 1,ai,bj + 1,h + 1);
            cb[bj + 1] = 0;
        }
    }
    else{ //a
        if(j <= n)
            temp = dfs(i,j + 1,ai,bj,h + 1);
        if(ai < k && i <= n){
            ca[ai + 1] = a[i];
            if(j <= n) temp = max(temp,dfs(i + 1,j,ai + 1,bj,h + 1));
            else temp = dfs(i + 1,j,ai + 1,bj,h + 1);
            ca[ai + 1] = 0;
        }
    }
    return temp;
}

int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    ll T = 1;
    // cin >> T;
    while(T--){
        cin >> n >> k;
        for(int i = 1;i <= n;i++) cin >> a[i];
        for(int i = 1;i <= n;i++) cin >> b[i];
        sort(a + 1,a + n + 1,greater<ll>());
        sort(b + 1,b + n + 1,greater<ll>());
        cout << dfs(1,1,0,0,0) << "\n";
    }
	return 0;
}