#include<bits/stdc++.h>usingnamespace std;typedeflonglong ll;const ll MAXN =5e5+10;
ll a[MAXN];
ll b[MAXN];
ll mine[MAXN];
ll maxe[MAXN];boolcmp(ll a, ll b){return a > b;}intmain(){
ll n, k;scanf("%lld %lld",&n,&k);for(ll i =1; i <= n; i++){scanf("%lld",&a[i]);}for(ll i =1; i <= n; i++){scanf("%lld",&b[i]);}for(ll i =1; i <= n; i++){
mine[i]=min(a[i], b[i]);
maxe[i]=max(a[i], b[i]);}if(n ==2){if(k &1)swap(a[1], a[2]);
ll res =abs(a[1]- b[1])+abs(a[2]- b[2]);printf("%lld\n", res);return0;}sort(mine +1, mine +1+ n, cmp);sort(maxe +1, maxe +1+ n);
ll sum =0;for(ll i =1; i <= n; i++){
sum +=abs(a[i]- b[i]);}for(ll i =1; i <=min(n, k); i++){if(maxe[i]< mine[i]){
sum +=(mine[i]- maxe[i])*2;}}printf("%lld\n", sum);return0;}