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 main()
{
int n, k;
cin >> n >> k;
int t[n];
int a, b;
cin >> b;
for(int i = 2; i <= n; i++)
{
a = b;
cin >> b;
t[i-1] = b-a - 1;
}
sort(t+1, t+n);
int res = n;
for(int i = 1; i <= n-k; i++) res += t[i];
cout << res << '\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... |