#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 998244353
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

struct UnionFind{
    private:
    vector<int> par,siz;

    public:
    int con;
    UnionFind(int n):par(n),siz(n,1),con(n){
        iota(begin(par),end(par),0);
    }
    int root(int x){
        return (par[x]==x?x:(par[x]=root(par[x])));
    }
    bool sameroot(int x,int y){
        return root(x)==root(y);
    }
    bool unite(int x,int y){
        x=root(x);y=root(y);
        if(x==y) return false;
        if(siz[x]<siz[y])swap(x,y);
        siz[x]+=siz[y];
        par[y]=x;
        con--;
        return true;
    }
    int size(int x){
        return siz[root(x)];
    }
};



signed main(){
    int n,k;cin>>n>>k;k=n-k;
    vector<ll> a(n);
    cin>>a;
    vector<ll> s(n+1,0);
    rep(i,n) s[i+1]=s[i]+a[i];

    ll ans=LINF;
    ll lsum=0,rsum=0;
    rep(i,k) rsum+=a[n-1-i];

    for(int l=0;l<=k;l++){
        int r=k-l;

        int mid=(n-l-r)/2+l;
        

        auto f=[&](ll x){
            int mi=lower_bound(ALL(a),x)-begin(a);
            ll tmp=0;
            tmp+=s[n-r]-s[mi]-x*(n-r-mi);
            tmp-=rsum-x*r;
            tmp+=x*(mi-l)-(s[mi]-s[l]);
            tmp-=x*l-lsum;
            return tmp;
        };

        ll lw=a[max(0,l-1)],hi=a[min(n-1,n-1-r)];
        while(hi-lw>10){
            ll mlw=(2*lw+hi)/3,mhi=(lw+2*hi)/3;
            if(f(mlw)>f(mhi)){
                lw=mlw;
            }else{
                hi=mhi;
            }
        }
        for(ll i=lw;i<=hi;i++){
            chmin(ans,f(i));
        }

        lsum+=a[l];
        rsum-=a[n-r];
    }
    cout<<ans<<endl;
    return 0;
}