Submission #227376

#TimeUsernameProblemLanguageResultExecution timeMemory
227376NaynaStove (JOI18_stove)C++14
100 / 100
84 ms3288 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...