# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
648197 | jekabs | Stove (JOI18_stove) | C++14 | 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 <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int t[n];
for(auto &x:t)
{
cin >> x;
}
sort(t, t + n);
vector <int> atn;
int ans = t[n-1] - t[0] + 1;
for(int i = 0;i < n;i++)
{
atn.push_back(t[i] - t[i-1] - 1);
}
sort(atn.begin(),atn.end(), greater<int>());
for(int i = 0;i < k - 1;i++)
{
ans-=atn[i];
}
cout << ans;
return 0;
}