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 n, k, i, timego[100002], kc[100002];
int main(){
cin >> n >> k;
if(n==k){
cout << n;
return 0;
}
else{
for(i=1;i<=n;i++)
cin >> timego[i];
for(i=1;i<n;i++)
kc[i] = timego[i+1] - timego[i] - 1;
sort(kc+1, kc+n);
int ans = n;
for(i=1;i<n-k+1;i++)
ans += kc[i];
cout << ans;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |