1421

#include<iostream>
#include<algorithm>
using namespace std;
#define INF 100000000;
int f[2001][1001];//dp[i][j]表示从1……i个物品中选取j对
int a[2001];
int min( int a, int b)
{
 if( a > b)
 {
  return b;
 }
 return a;
}

int main()
{
    int n,k,i,j;
    while( cin >> n >> k)
    {
        for(i=1;i<=n;i++)
        {
            cin>>a[i];
        }

        sort(a, a+n+1);

        for(i=1;i<n;i++)
        {
         
            a[i] = (a[i+1] - a[i]) * (a[i+1] - a[i]);
        }

        for(i=0;i<=n;i++)//物品
        {
            for(j=1;j<=k;j++)//所取物品对数
            {
                f[i][j] = INF;//要足够大
            }
        }
   
        for(i=0;i<=n;i++)
        {
            f[i][0] = 0;
        }

        for(i=2;i<=n;i++)//物品
        {
            for(j=1;2*j<=i;j++)//所取物品对数
            {
 //            cout << i-2 << " " << j-1 << " " << a[i-1]<< " " << f[i-2][j-1] << " " << f[i-1][j] << endl;
                f[i][j] = min(f[i-2][j-1] + a[i-1] , f[i-1][j]);
            }
        }
/*       for(i = 0; i < 10; i++)
        {
         for(j = 0; j < 10; j++)
         {
          cout << f[i][j] << " ";
   }
   cout << endl;
  } */
        cout<<f[n][k]<<endl;
    }
    return 0;
}