题意:给出一串序列,要分成k组,每组的值等于组内最大减最小,使总的值最小,求最小总值。
题解:贪心
对差值进行排序,累加。
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
const int maxn = 3e5 + 10;
int n, k, a[maxn], s[maxn], ans;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 2; i <= n; i++) s[i - 1] = a[i] - a[i - 1];
ans = a[n] - a[1];
sort(s + 1, s + n);
for (int i = n - 1; i >= n - k + 1; i--) {
ans += -s[i];
}
printf("%d\n", ans);
}