# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
647970 | rohith_231 | Stove (JOI18_stove) | C++17 | 0 ms | 0 KiB |
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() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n,k; cin>>n>>k;
vector<int>arr(n); for(size_t i=0;i<n;i++) cin>>arr[i];
vector<int>diff(n-1);
for(size_t i=0;i<n-1;i++) {
diff[i] = arr[i+1]-arr[i]-1;
}
sort(diff.begin(),diff.end(),greater<int>());
int res = arr[n-1]+1-arr[0];
for(size_t i=0;i<k-1;i++) res-=diff[i];
cout<<res<<endl;
return 0;