#include <bits/stdc++.h>
using namespace std;
#define task "main"
#define F first
#define S second
#define ii pair<int, int>
#define il pair<int, long long>
#define li pair<long long, int>
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
const int MAX_N = (int)1e5 + 5;
int n, k;
int a[MAX_N], b[MAX_N];
namespace sub1 {
void solve() {
vector<int> arr;
long long ans = 0;
FOR(i, 1, n)
arr.push_back(a[i] - b[i]);
sort(arr.begin(), arr.end());
FOR(i, 0, n - 1)
ans += abs(arr[i] - arr[n / 2]);
cout << ans << "\n";
}
}
namespace sub2 {
long long s[MAX_N];
void solve() {
FOR(i, 1, n) a[i] -= b[i];
sort(a + 1,a + n + 1);
FOR(i, 1, n) s[i] = s[i - 1] + a[i];
long long res = 1e18;
FOR(i, 0, k) {
int l = i + 1;
int r = n - (k - i);
int mid = (l + r) >> 1;
res = min(res, 1LL * a[mid] * (mid - l + 1) - (s[mid] - s[l - 1]) + (s[r] - s[mid]) - 1LL * a[mid] * (r - mid));
}
cout << res;
}
}
void solve() {
cin >> n >> k;
FOR(i, 1, n) cin >> a[i];
FOR(i, 1, n) cin >> b[i];
if (k == 0) sub1::solve();
else sub2::solve();
}
int32_t main() {
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
bool multitest = 0;
int numTest = 1;
if (multitest) cin >> numTest;
while (numTest--) {
solve();
}
return 0;
}
/* Lak lu theo dieu nhac!!!! */
