#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
#define debug(x) cout << #x << ":" << x << "\n";
const int maxn = 10010;
const ll ool = 1000000000000ll;
int n,k;
int d[maxn];
ll sumd[maxn][maxn];
ll ans = ool;

int main(){
	#ifndef DEBUG
		string FileName="qwa";
		freopen((FileName+".in").c_str(),"r",stdin);
		freopen((FileName+".out").c_str(),"w",stdout);
	#endif
	scanf("%d%d",&n,&k);
	for(int i = 0; i < n; i++)scanf("%d",&d[i]), sumd[i][0]=d[i];
	sort(d,d+n);
/*	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			sumd[i][j] = abs(d[j] - d[i]);
		}
	}*/
	for(int l = 0; l < n-k; l++){
		ll temp(0);
		for(int r = k; r <= n; r++){
			for(int i = l; i < r; i++){
				temp += abs(d[i]-d[l])+abs(d[r]-d[i]);
				if(temp > ans)break;
			}
		}
		ans = min(ans, temp);
	}
//	printf("%I64d",ans);
	printf("%lld",ans);
}