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>
#define long long long
using namespace std;
vector<int> v, d;
int n, k, ans,t;
int main() {
cin>>n>>k;
for(int i = 0; i < n; i++) {
cin>>t;
v.push_back(t);
}
for(int i = 1; i < n; i++) {
d.push_back(v[i] - v[i-1] - 1);
}
sort(d.begin(), d.end(), greater<int>());
ans = v[n-1] - v[0] + 1;
for(int i = 0; i < k-1; i++) {
ans -= d[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... |