# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
207067 | Blerargh | 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;
typedef long long ll;
int main(){
ll n, k, x, prev, sum=0;
cin >> n >> k >> prev;
vector<int> v;
for (int i=1; i<n; i++){
cin >> x;
sum += x-prev;
v.push_back(x-prev)
prev=x;
}
sort(v.begin(), v.end(), greater<int>());
for (int i=0; i<m-1; i++){
sum-=v[i];
sum++;
}
cout << sum;
}