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 a[100010];
int main()
{
int n, k;
cin >> n >> k;
int t0, t1;
cin >> t0;
for(int i = 0; i < n - 1; i++)
{
cin >> t1;
a[i] = t1 - t0 - 1;
t0 = t1;
}
sort(a, a + n);
int s = n;
for(int i = 0; i < (n - k + 1); i++) s += a[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... |