#include<algorithm>

#include<iostream>

#include<cstring>

#include<cstdio>

using namespace std;

inline int rd(){

  int ret=,f=;char c;

  while(c=getchar(),!isdigit(c))f=c=='-'?-:;

  while(isdigit(c))ret=ret*+c-'',c=getchar();

  return ret*f;

}

const int MAXN=;

int n,m;

int val[MAXN],sum[MAXN],dis[MAXN][MAXN];

int f[MAXN][],tran[MAXN][];

int main(){

  memset(f,0x3f,sizeof(f));

  n=rd();m=rd();

  for(int i=;i<=n;i++) val[i]=rd();

  sort(val+,val++n);

  for(int i=;i<=n;i++) sum[i]=sum[i-]+val[i];

  for(int i=;i<=n;i++)

    for(int j=i+;j<=n;j++)

      dis[i][j]=dis[i][j-]+val[j]-val[i+j>>];

  for(int i=;i<=n;i++) f[i][]=dis[][i];

  int mn=<<,mnid;

  for(int j=;j<=m;j++){

    tran[n+][j]=n-;

    for(int i=n;i>=j;i--){

      for(int k=tran[i][j-];k<=tran[i+][j];k++){

        if(f[k][j-]+dis[k+][i]<f[i][j]){

          f[i][j]=f[k][j-]+dis[k+][i];

          tran[i][j]=k;

        }

      }

    }

  }

  cout<<f[n][m];

  return ;

}