#include<bits/stdc++.h>
const int N = 1e5+5;
using i64 = long long;
int n, m, a[N], b[N]; i64 f[N][11][11], vis[N][11][11];
signed main() {
    scanf("%d%d", &n ,&m); m = std::min(m, n);
    for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    for(int i = 1; i <= n; ++i) scanf("%d" ,&b[i]);
    std::sort(a + 1, a + n +1);
    std::sort(b + 1, b + n + 1);
    std::reverse(a + 1, a +n + 1);
    std::reverse(b + 1, b+ n + 1);
    //memset(f, 0xcf, sizeof f);
    // for(int i = 0; i <= n; ++i)
    //     for(int j = 0; j <= m; ++j)
    //         for(int k = 0; k <= m; ++k)
    //             f[i][j][k] = -2e9;
    f[0][0][0] = 0;
    for(int i = 1; i <= n; ++i)
        for(int j = 0; j <= std::min(i, m); ++j)
            for(int k = 0; k <= std::min(i, m); ++k) {
                 i64 num = 1e18;
                if(j) {
                    if(k && i + j - k <= n && i + k - j <= n && !vis[i - 1][j - 1][k - 1]) num = std::min(num, f[i - 1][j - 1][k - 1] + a[i + j - k] - b[i + k - j]);
                    if(k <= i - 1 && i + j - k - 1 <= n && !vis[i - 1][j - 1][k]) num = std::min(num, f[i - 1][j - 1][k] + a[ i + j - k - 1]);
                    if(num != 1e18) f[i][j][k] = std::max(f[i][j][k], num);
                }
                i64 num1 = 1e18;
                if(k && j <= i - 1 && i + k - j - 1 <= n && !vis[i - 1][j][k - 1]) num1 = std::min(num1, f[i - 1][j][k - 1] - b[i + k - j - 1]);
                if(j <= i -1  && k <= i -1 && !vis[i - 1][j][k] ) num1 = std::min(num1, f[i -1][j][k]);
                if(num1 != 1e18) f[i][j][k] = std::max(f[i][j][k], num1);
                if(num == 1e18 && num1 == 1e18) vis[i][j][k] = 1;
            }

    i64 ans = -1e18;
    for(int i = 0; i <= m; ++i) {
        i64 num = 1e18;
        for(int j = 0; j <= m; ++j){
            //printf("%lld ", f[n][i][j]);
            num = std::min(num, f[n][i][j]);
        }
       // puts("");
        ans = std::max(ans, num);
    }
    
    printf("%lld\n", ans);
    return 0;
}