#include<iostream>
#include<cstdio>

using namespace std;
	const int maxlong=3000000;
	int dt[3001][3001];
	long long sum[3001];
	int data[3001];
	long long f[3001][10];
	int n,m;
void qsort(int a[],int l,int r);	
void qsort(int a[],int l,int r)
{
	int i,j,x,y;
	i=l;j=r;x=a[(i+j)/2];
	while (i<=j)
	{
		while (a[i]<x) i++;
		while (a[j]>x) j--;
		if (i<=j)
		{
			y=a[i];a[i]=a[j];a[j]=y;
			i++;j--;
		}
	}
	if (l<j) qsort(a,l,j);
	if (i<r) qsort(a,i,r);
}
int abs(int x);
int abs(int x)
{
	if (x<0) return -x;else return x;
}
int min(int x,int y);
int min(int x,int y)
{
	if (x<y) return x;else return y;
}
int main()
{
	freopen("map.in","r",stdin);
	freopen("map.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&data[i]);
	}
	qsort(data,1,n);
	for (int i=1;i<=n;i++)
	{
		sum[i]=sum[i-1]+data[i];
	}
	int aver;
	for (int i=1;i<=n-1;i++)
	{
		for (int j=i+1;j<=n;j++)
		{
			aver=0;
			if ((j-i+1)%2==0)
			{
				aver=(data[(i+j)/2]+data[(i+j)/2+1])/2;
			}
			else 
			{
				aver=data[(i+j)/2];
			}
			for (int k=i;k<=j;k++)
			{
				dt[i][j]+=abs(data[k]-aver);
			}
			
		}
	}
	for (int j=1;j<=n;j++)
	{
		f[j][1]=dt[1][j];
	}
	for (int j=1;j<=n;j++)
	{
		for (int i=2;i<=m;i++)
		{
			if (j-i>=0)
			{
				f[j][i]=maxlong;
				for (int k=i-1;k<=j-1;k++)
				{
		f[j][i]=min(f[j][i],f[k][i-1]+dt[k+1][j]);
				}
			}
		}
	}
	printf("%lld",f[n][m]);
	return 0;
}