#include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
// using namespace atcoder;
using lint = long long;
template<class T>using graph = vector<vector<T>>;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<62;
lint const mod = 1e9+7;
//long const mod = 998244353;


int main(){
    lint n,k;
    cin >> n >> k;
    lint a[n];
    for(int i=0;i<n;i++)cin >> a[i];
    sort(a,a+n);
    lint leftX = a[0];
    lint rightX = a[n-1];
    lint left = 0;
    lint right = 0;
    for(int i=0;i<n;i++){
        lint b = -1;
        if(i < k){
            b = 1;
        }
        left += b * abs(a[i] - leftX);
        right += b *abs(rightX- a[n-1-i]);
    }
    cout << min(left, right) << endl;
}