#include<cstdio>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
#define inf 1000000000;
using namespace std;
int d[2005][2005],a[2005];
int main()
{ int n,k,i,j;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
while(scanf("%d%d",&n,&k)!=EOF){
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(i=0;i<=n;i++)
for(j=1;j<=k;j++)
d[i][j]=inf;
d[0][0]=0;
for(i=2;i<=n;i++)
for(j=1;j<=k;j++)
{
d[i][j]=min(d[i-1][j],d[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1]));
}
printf("%d\n",d[n][k]);
}
return 0;
}
08-08
06-28