#include <bits/stdc++.h>
#include <time.h>
//#include <random>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;
//mt19937 rnd(0);
ll n, k, a[N], b[N];
vector <pair <ll, int> > v;
vector <ll> vec;
bool mk[N];
void solve() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
v.pb({a[i] - b[i], i});
sort(v.begin(), v.end());
int l = 0, r = n - 1;
while (k > 0) {
if (abs(v[l].ft) > abs(v[r].ft)) l++;
else r--;
k--;
}
for (int i = 0; i < l; i++)
mk[v[i].sd] = 1;
for (int i = n - 1; i > r; i--)
mk[v[i].sd] = 1;
for (int i = 0; i < n; i++)
if (!mk[i])
vec.pb(a[i] - b[i]);
sort(vec.begin(), vec.end());
ll ans = 0;
for (int i = 0; i < n; i++)
if (!mk[i])
ans += abs(a[i] - vec[sz(vec) / 2] - b[i]);
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef _LOCAL
in("input.txt");
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
cout << "Test #" << i << elf;
clock_t start_time = clock();
solve();
cerr.precision(4); cerr << fixed;
cerr << elf;
cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;
cout << elf;
}
#else
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << el;
}
#endif
}
