#include <bits/stdc++.h>
#define int int64_t

using std::cin;
using std::cout;
const char endl = '\n';
const int maxn = (int)1.1E5;

int n, k;
int a[maxn], b[maxn];

int dp[maxn * 2][13][13];
bool vis[maxn * 2][11][11];

int dfs(int u, int k1, int k2) {
  if (u >= n * 2) return 0;
  if (vis[u][k1][k2]) return dp[u][k1][k2];
  vis[u][k1][k2] = 1;
  int &d = dp[u][k1][k2];
  if ((u & 1) == 0) {
    if(k1 + 1 <= k and n - (u / 2 - k2) - k1 >= 1)      d = std::max(d, dfs(u + 1, k1 + 1, k2) + a[n - (u / 2 - k2) - k1]);
    if(k2 + u/2 - k1 < n) d = std::max(d, dfs(u + 1, k1, k2));
  } else {
    if(k2 + 1 <= k and n - ((u+1)/2 - k1) - k2 >= 1)      d = std::min(d, dfs(u + 1, k1, k2 + 1) - b[n - ((u+1)/2 - k1) - k2]);
    if(k1 + u/2 - k2 < n) d = std::min(d, dfs(u + 1, k1, k2));
  }
  return d;
}

void solve() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i) cin >> b[i];
  std::sort(a + 1, a + 1 + n);
  std::sort(b + 1, b + 1 + n);
  cout << dfs(0, 0, 0) << endl;
}

int32_t main() {
#ifndef _DEBUG
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
#endif
  int tc = 1;
  // std::cin >> tc;
  while (tc--) solve();
#ifdef _DEBUG
  std::cout << std::endl;
  std::cout << "Time used: " << clock() << "ms" << std::endl;
  system("pause");
  return 0;
#endif
}