#include<bits/stdc++.h>
using namespace std;
constexpr int N=1e5+5,M=22;
int n,k,a[N],b[N],dp[M][M][M][M],vis[M][M][M][M];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
int dfs(int x,int y,int dx,int dy){
    if (x>n&&y>n) return 0;
    if (vis[x][y][dx][dy]) return dp[x][y][dx][dy];
    vis[x][y][dx][dy]=1;int ans;
    if (x+y&1){
        ans=INT_MAX;
        if (x<=n) ans=min(ans,dfs(x+1,y,dx,dy));
        if (y<=n) ans=min(ans,(dy<=k?-b[y]:0)+dfs(x,y+1,dx,dy+1));
    }
    else{
        ans=-INT_MAX;
        if (x<=n) ans=max(ans,(dx<=k?a[x]:0)+dfs(x+1,y,dx+1,dy));
        if (y<=n) ans=max(ans,dfs(x,y+1,dx,dy));
    }
    return dp[x][y][dx][dy]=ans;
}
int main(){
    n=read();k=read();
    for (int i=1;i<=n;i++) a[i]=read();
    for (int i=1;i<=n;i++) b[i]=read();
    sort(a+1,a+n+1,greater<int>());
    sort(b+1,b+n+1,greater<int>());
    n=min(n,k<<1);printf("%d\n",dfs(1,1,1,1));
    return 0;
}