#include <bits/stdc++.h>
using i64 = long long;

const int maxn = 3e3 + 5;
const int maxm = 15;
const i64 INF = 1e16;
int n,m,a[maxn];
i64 sum[maxn],f[maxn][maxm],val[maxn][maxn];

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",&a[i]);
	std::sort(a + 1 , a + 1 + n);
	for(int i = 1;i <= n;++ i)
		sum[i] = sum[i - 1] + a[i];
	for(int i = 1;i <= n;++ i) {
		for(int j = i;j <= n;++ j) {
			int k = (i + j) / 2;
			val[i][j] = 1ll * (k - i + 1) * a[k] - (sum[k] - sum[i - 1]) + (sum[j] - sum[k]) - 1ll * (j - k) * a[k];
		}
	}
	f[0][0] = 0;
	for(int k = 1;k <= m;++ k)
		f[0][k] = INF;
	for(int i = 1;i <= n;++ i) {
		f[i][0] = INF;
		for(int k = 1;k <= m;++ k) {
			f[i][k] = INF;
			for(int j = i - 1;~ j;-- j) {
				f[i][k] = std::min(f[i][k] , f[j][k - 1] + val[j + 1][i]);
			}
		}
	}
	i64 ans = INF;
	for(int k = 1;k <= m;++ k)
		ans = std::min(ans , f[n][k]);
	printf("%lld",ans);
	return 0;
}