编程挑战：2019Nitacm校赛D题-雷顿女士与分队（高级版）

#include
using namespace std;
#define inf 0x3f3f3f3f
const int maxn=2e5+10;
int a[maxn], dp[maxn];
int main() {
int T;
cin >> T;
while (T--) {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) dp[i] = inf;
dp[0] = 0;
for (int i = k; i <= n; i++) {
if (i % k == 0) dp[i] = dp[i - k] + a[i] - a[i - k + 1];
else dp[i] = min(dp[i - k] + a[i] - a[i - k + 1], dp[i - 1] + a[i] - a[i - 1]);
}
cout < }
return 0;
}