#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
const ll inf = 4611686018427387903LL;
const int MOD=998244353;
int main()
{
  int N,K;
  cin >> N >> K;
  vector<ll>a(N);rep(i,N)cin >> a[i];
  ll ans=inf;
  int w=25;
  priority_queue<ll>q;
  for(int i=0;i<min(N,w);i++){
    rep(j,N)q.push(abs(a[i]-a[j]));
    ll s=0;
    rep(j,N){
      if(j<N-K)s-=q.top();
      else s+=q.top();
      q.pop();
    }
    ans=min(ans,s);
  }
  for(int i=N-1;i>=max(0,N-1-w);i--){
    rep(j,N)q.push(abs(a[i]-a[j]));
    ll s=0;
    rep(j,N){
      if(j<N-K)s-=q.top();
      else s+=q.top();
      q.pop();
    }
    ans=min(ans,s);
  }
  for(int i=max(0,N/2-w/2);i<min(N,N/2+w/2);i++){
    rep(j,N)q.push(abs(a[i]-a[j]));
    ll s=0;
    rep(j,N){
      if(j<N-K)s-=q.top();
      else s+=q.top();
      q.pop();
    }
    ans=min(ans,s);
  }
  cout << ans << endl;
  return 0;
}