#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll llinf = (1ll << 61) - 1;
const double eps = 1e-6, ldeps = 1e-9;
struct Dbg {
  static constexpr auto &os = cout;
  template <class C>
  static auto dud(C *x) -> decltype(os << *x, 0);
  template <class C>
  static char dud(...);
  template <class C>
  typename enable_if<sizeof dud<C>(0) != 1, Dbg &>::type operator<<(
      const C &x) {
    os << x;
    return *this;
  }
  template <class C>
  Dbg &dump(C b, C e) {
    *this << "\n[";
    int cur = 0;
    for (C i = b; i != e and cur < 26; i++, cur++)
      *this << ", " + 2 * (i == b) << *i;
    return *this << ']';
  }
  template <class C>
  typename enable_if<sizeof dud<C>(0) == 1, Dbg &>::type operator<<(
      const C &x) {
    return dump(begin(x), end(x));
  }
  template <class C, size_t X>
  typename enable_if<sizeof(C) != 1, Dbg &>::type operator<<(C (&x)[X]) {
    return dump(begin(x), end(x));
  }
  template <class B, class C>
  Dbg &operator<<(const pair<B, C> &x) {
    return *this << '{' << x.first << ", " << x.second << '}';
  }
  template <class C, size_t Y>
  struct TP {
    void operator()(Dbg &os, const C &t) {
      TP<C, Y - 1>()(os, t);
      os << ", " << get<Y - 1>(t);
    }
  };
  template <class C>
  struct TP<C, 1> {
    void operator()(Dbg &os, const C &t) { os << get<0>(t); }
  };
  template <class... C>
  Dbg &operator<<(const tuple<C...> &t) {
    os << '{', TP<decltype(t), sizeof...(C)>()(*this, t);
    return *this << '}';
  }
  Dbg &operator<<(ostream &(*x)(std::ostream &)) {
    os << x;
    return *this;
  }
} dbg;
void err(istringstream *iss) { delete iss; }
template <class C, class... Args>
void err(istringstream *iss, const C &val, const Args &...args) {
  string name;
  *iss >> name;
  if (name.back() == ',') name.pop_back();
  dbg << name << " = " << val << "; ", err(iss, args...);
}
int n, m, K, T, Q, cn;
const int inf = 1000000007, mxn = 300005, mxk = 5005;
ll dp[3][mxk], cs[mxn];
int a[mxn];
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.precision(11);
  cin >> n >> K;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    a[i] = a[i + 1] - a[i];
    cs[i + 1] = cs[i] + a[i];
  }
  int sz1 = n / K, sz2 = n / K + 1, cnt2 = n % K, cnt1 = K - cnt2;
  assert(sz1 > 0 and sz2 > 0 and cnt1 * sz1 + cnt2 * sz2 == n);
  for (int i = cnt1; i >= 0; i--) {
    for (int j = cnt2; j >= 0; j--) {
      int cur = i * sz1 + j * sz2;
      dp[(i)&1][j] =
          cur == n
              ? 0ll
              : min(i == cnt1
                        ? llinf
                        : cs[cur + sz1 - 1] - cs[cur] + dp[(i + 1) & 1][j],
                    j == cnt2 ? llinf
                              : cs[cur + sz2 - 1] - cs[cur] + dp[(i)&1][j + 1]);
    }
  }
  cout << dp[(0) & 1][0] << '\n';
}
