#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define long long lnt;
using namespace std;

const int up=10000+5;
int a[up],n,k,maxn=0x7f7f7f7f;
int qiu(int);

int main()
{
    freopen("qwa.in","r",stdin);
    freopen("qwa.out","w",stdout);

    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    for(int i=k;i<=n;i++) maxn=min(maxn,qiu(i));
    printf("%d",maxn);

    return 0;
}

int qiu(int i)
{
    int l=i-k+1,r=i,sum=0,ne=k+1;
    while(l<r) sum+=(a[r]-a[l])*(ne-=2),l++,r--;
    return sum;
}