#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

const long long INF = 1LL<<60;
int n, k;
long long a[55555];
long long dp[2][55555];

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> k;
  REP (i, n) cin >> a[i];
  sort(a, a + n);

  REP (i, 2) REP (j, 55555) dp[i][j] = INF;
  dp[0][0] = 0;

  REP (i, n) {
    int cur = i & 1;
    int nxt = (i + 1) & 1;
    fill(dp[nxt], dp[nxt]+k+1, INF);
    REP (j, k+1) {
      if (dp[cur][j] == INF) continue;
      if (i >= 1)
        dp[nxt][j] = min(dp[nxt][j], dp[cur][j] - a[i-1] + a[i]);
      if (j + 1 <= k)
        dp[nxt][j+1] = min(dp[nxt][j+1] , dp[cur][j]);
    }
  }

  cout << dp[n&1][k] << endl;

  return 0;
}