施魔法

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 3e5+5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int mod = 1e9+7;
ll dp[maxn],a[maxn];

int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=1; i<=n; i++)
    {
        scanf("%lld",&a[i]);
    }
    sort(a+1,a+1+n);
    ll tmp = -a[1];
    for(int i=1; i<k; i++)
    {
        dp[i] = INF;
    }
    for(int i=k; i<=n; i++)
    {
        dp[i] = tmp + a[i];
        tmp = min(tmp,dp[i-k+1]-a[i-k+2]);
    }
    printf("%lld",dp[n]);
}