#include <bits/stdc++.h>
namespace chtholly {
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
  return f ? x : -x;
}
template <typename mitsuha>
inline bool read(mitsuha &x) {
  x = 0;
  int f = 1;
  char c = getchar();
  for (; !isdigit(c) && ~c; c = getchar()) f ^= c == '-';
  if (!~c) return 0;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
  return x = f ? x : -x, 1;
}
template <typename mitsuha>
inline int write(mitsuha x) {
  if (!x) return 0 & putchar(48);
  if (x < 0) x = -x, putchar('-');
  int bit[20], i, p = 0;
  for (; x; x /= 10) bit[++p] = x % 10;
  for (i = p; i; --i) putchar(bit[i] + 48);
  return 0;
}
inline char fuhao() {
  char c = getchar();
  for (; isspace(c); c = getchar())
    ;
  return c;
}
}  // namespace chtholly
using namespace chtholly;
using namespace std;
const int yuzu = 3e5, aoi = 5013;
int a[yuzu | 10], dp[aoi][aoi];
int main() {
  int i, j, n = read(), k = read();
  for (i = 1; i <= n; ++i) a[i] = read();
  sort(a + 1, a + n + 1);
  int xbl = n / k, dbl = n / k + 1, ctx = n % k, ctd = k - ctx;
  a[0] = a[1], a[n + 1] = a[n];
  for (i = 0; i <= ctx; ++i) {
    for (j = 0; j <= ctd; ++j) {
      if (i) {
        int pos = (i - 1) * dbl + j * xbl;
        dp[i][j] = max(dp[i][j], dp[i - 1][j] + a[pos + 1] - a[pos]);
      }
      if (j) {
        int pos = i * dbl + (j - 1) * xbl;
        dp[i][j] = max(dp[i][j], dp[i][j - 1] + a[pos + 1] - a[pos]);
      }
    }
  }
  write(a[n] - a[1] - dp[ctx][ctd]);
}
