#include #include int min(int x,int y) { if (xa[j]) {t=a[i];a[i]=a[j];a[j]=t;} if (k*2>n) printf("-1"); else {for(i=0;i<=n;i++) {f[i][0]=0; for (j=1;j<=k;j++)f[i][j]=99999999;} for (i=2;i<=n;i++) for (j=1;j<=k;j++)f[i][j]=min(f[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1]),f[i-1][j]); printf("%d",f[n][k]);} }