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 <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#define ll long long
using namespace std;
vector <ll> V;
ll n, k, f, A[100000];
int main() {
cin >> n >> k;
f = n;
for (int i=0; i<n; ++i) {
cin >> A[i];
if (i) V.push_back(A[i]-A[i-1]-1);
}
sort(V.begin(), V.end());
for (int i=0; i<n-k; ++i) {
f += V[i];
}
cout << f << '\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... |