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;
int n, k, ar[100001] = {}, res = 0;
int main()
{
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> ar[i];
for (int i = n - 1; i; i--)
{
ar[i] -= ar[i - 1] + 1;
}
sort(ar + 1, ar + n);
for (int i = 1; i <= n - k; i++) {res += ar[i];}
cout << res + n << "\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... |