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 <algorithm>
using namespace std;
const int nmax = 1e5;
int v[nmax];
int main() {
int n, k, a, b;
cin >> n >> k >> a;
for ( int i = 1; i < n; i++ ) {
cin >> b;
v[i] = b - a - 1;
a = b;
}
sort ( v + 1, v + n );
int s = n;
for ( int i = 1; i <= n - k; i++ )
s += v[i];
cout << s;
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... |