# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990580 | StuckOnA | 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()
{
int n, k;
cin >> n >> k;
vi v(n), vd(n - 1);
input(v);
for (int i = 0; i < n - 1; i++)
vd[i] = v[i + 1] - v[i] - 1;
sort(rall(vd));
int sum = 0;
for (int i = 0; i < k - 1; i++)
sum += vd[i];
cout << *max_element(all(v)) - sum << endl;
return 0;
}