#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define pb push_back
#define st first
#define nd second
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
int T[n];
rep(i, n) {
cin >> T[i];
}
sort(T, T + n);
vector<int> r;
rep(i, n - 1) {
r.pb(T[i + 1] - T[i] - 1);
}
sort(r.begin(), r.end());
reverse(r.begin(), r.end());
int ans = T[n - 1] + 1 - T[0];
rep(i, k - 1) {
ans -= r[i];
}
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |