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;
using ll = long long;
int main(){
ll t = 1;
while(t--) {
ll n, k;
cin >> n >> k;
ll t1[n], s[n - 1];
for (int i = 0;i < n; i++) {
cin >> t1[i];
if (i > 0) {
s[i - 1] = t1[i] - t1[i - 1] - 1;
}
}
sort(s, s + n - 1);
ll sum = n;
for (int i = 0;i < n - k; i++) {
sum += s[i];
}
cout << sum;
}
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... |