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;
int t[n];
int a[n];
cin >> t[0];
for (int i = 1; i < n; i++)
{
cin >> t[i];
a[i - 1] = t[i] - t[i - 1];
}
sort (a, a + n);
int rez = n;
for (int i = 0; i < n - k; i++)
{
rez = rez - 1 + a[i];
}
cout << rez;
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... |