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;
const ll mod = 1e9 + 7;
int main(){
int n, k;
cin >> n >> k;
vector<ll> temp(n), v;
for(auto& i : temp){
cin >> i;
}
for(int i = 1; i < n; ++i){
v.push_back(temp[i] - temp[i - 1] - 1);
}
sort(begin(v), end(v));
ll sol = n;
for(int i = 0; i < n - k; ++i){
sol += v[i];
}
cout << sol << endl;
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... |