# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1217205 | gabyferaq | Stove (JOI18_stove) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
void solve()
{
ll n,k; cin>>n>>k;
vector<ll> vec(n), t(n-1);
cin>>vec[0];
for(int i=1;i<n;i++)
{
cin>>vec[i];
t[i-1]=vec[i]-vec[i-1]-1;
}
ll sum=0;
sort(t.begin(),t.end());
for(int i=0;i<=n-k-1;i++)
{
sum+=t[i];
}
cout<<n+sum<<endl;
}
int main()
{
solve();
}