#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

//* Take every thing 1 based indexed (even prefix , except input a[ ]  )

int consistency(int n, int k){
	
    sort(begin(a), end(a)); 
    
    vector<int> pf(n+1, 0);
    for(int i=0; i<n; i++){
        pf[i+1] = pf[i] + a[i];
    }   
    
    vector<vector<int>> dp(n+1, vector<int>(k+1, INF));
    dp[0][0] = 0;
    
    for(int i=1; i<=n; i++){
        for(int x=1; x<=k; x++){    
        	
            int j = i-1;
            while(j>=0){
            	
                int mid = (i+j)/2 + 1;
                
                int leftCost = (mid-j)*a[mid-1] - (pf[mid] - pf[j]);
                int rightCost =  (pf[i]-pf[mid]) - (i-mid)*a[mid-1];    
                
                dp[i][x] = min(dp[i][x], dp[j][x-1] + leftCost + rightCost );
                
                j--;
            }
        }
    }   
    
    return dp[n][k];
}















int practice(int n, int k){


    return 0;
}





void solve() {
    
    int n, k;
    cin>> n >> k;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n, k) << endl;


}





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

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}