#include "bits/stdc++.h"

const int N = 3010, M = 20, INF = 0x3f3f3f3f;

int n, m;
int f[N][M], a[N], s[N];

int main() {
    freopen("map.in", "r", stdin); 
    freopen("map.out", "w", stdout);
    
    memset(f, 0x3f, sizeof f);
    std::cin >> n >> m;
    for (int i = 1; i <= n; ++ i) {
        std::cin >> a[i];
    }

    std::sort(a + 1, a + 1 + n);

    auto calc = [&] (int l, int r) {
        int ret = 0;
        for (int k = l; k <= r; ++ k) 
            ret += std::abs(a[k] - a[(l + r + 1) / 2]);
        return ret;
    };

    f[0][0] = 0;

    for (int i = 1; i <= n; ++ i) {
        for (int j = 1; j <= m; ++ j) {
            for (int k = 0; k < i; ++ k) {
                f[i][j] = std::min(f[i][j], f[k][j - 1] + calc(k + 1, i));
            }
        }
    }

    std::cout << f[n][m] << '\n';
    return 0;
}