This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[100005];
int main () {
int n, k; cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
ll sum = a[n]+1-a[1];
vector<ll> v;
for (int i = 2; i <= n; ++i) {
v.push_back(a[i] - a[i-1]-1);
}
sort(v.begin(), v.end(), greater<ll>());
for (int i = 0; i < k - 1; ++i) sum -= v[i];
cout << sum << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |