#include <bits/stdc++.h>
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define F first
#define S second
#define pb push_back
#define M ll(998244353)
#define inf ll(2e9+7)
#define N ll(200500)
#define sz(x) x.size()
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
#define el '\n'
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> os;
ll a[N], b[N], i, n, k, ans = 1e18, kl, sm, sum, c[N], pr[N];
vector <ll> ve;
int main()
{
// in("input.txt");
// out("output.txt");
ios_base::sync_with_stdio(false);
iostream::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= n; i++)
{
cin >> b[i];
c[i] = b[i] - a[i];
}
sort(c + 1, c + 1 + n);
for (i = 1; i <= n; i++) a[i] += c[n / 2];
for (i = 1; i <= n; i++) ve.pb(b[i] - a[i]);
sort(ve.begin(), ve.end());
pr[0] = ve[0];
for (i = 1; i < n; i++) pr[i] = pr[i - 1] + ve[i];
ll j = 0;
while (j < n && ve[j] < 0) j++;
for (i = 0; i <= k; i++)
{
j = max(j, i);
ans = min(ans, pr[i + n - k - 1] - pr[j - 1] -
(pr[j - 1] - pr[i - 1])
);
}
cout << ans;
}
