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