#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, c[N], l, r;
bool cmp(int a, int b) {return (a > b);}
ll ans(ll x)
{
vector <int> p;
ll kl = 0;
for (i = 1; i <= n; i++) c[i] = a[i] + x;
for (i = 1; i <= n; i++) p.pb(abs(c[i] - b[i])), kl += abs(c[i] - b[i]);
sort(p.begin(), p.end(), cmp);
i = 0;
while (i < k) kl -= p[i], i++;
return kl;
}
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];
l = -1e6;
r = 1e6;
while (r - l > 10)
{
int m1 = l + (r - l) / 3;
int m2 = r - (r - l) / 3;
if (ans(m1) > ans(m2)) l = m1;
else r = m2;
}
ll an = 1e18;
for (; l <= r; l++) an = min(an, ans(l));
cout << an;
}
