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;
int main() {
int N, K;
cin >> N >> K;
vector<int> T(N);
for (int &v : T) {
cin >> v;
}
vector<int> D(N - 1);
for (int i = 0; i < N - 1; i++) {
D[i] = T[i + 1] - T[i] - 1;
}
sort(D.rbegin(), D.rend());
cout << T[N - 1] - T[0] + 1 - accumulate(D.begin(), D.begin() + K - 1, 0) << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |