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;
const int mxn = 5e5+5;
typedef pair<ll,ll>pii;
ll arr[mxn];
vector<ll>gap;
int main()
{
    ll n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> arr[i];
    for(int i = 1; i < n; i++) gap.push_back(arr[i+1]-arr[i]-1);
    sort(gap.rbegin(), gap.rend());
    ll ans  = arr[n]-arr[1]+1;
    for(int i = 0; i < k-1; i++) ans-=gap[i];
    cout << ans << '\n';
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |