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 k, n, input, totaltime;
vector<int> t, interval;
cin >> n >> k;
for(int i = 0; i < n; i++){
cin >> input;
t.push_back(input);
}
for(int i = 0; i < n-1; i++){
interval.push_back(t[i+1]-t[i]-1);
}
sort(interval.begin(), interval.end(), greater<int>());
totaltime = t[n-1]+1 - t[0];
for(int i = 0; i < k-1; i++){
totaltime -= interval[i];
}
cout << totaltime;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |