Submission #1255188

#TimeUsernameProblemLanguageResultExecution timeMemory
1255188timkaStove (JOI18_stove)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h>

using namespace std;

#define int long long

const int inf = 1e18;
const int mod = 1e9+7;

void solve()
{
    int n,k;
    cin >> n >> k;
    vector<int> a(n);
    for(auto &i:a) cin >> i;
    vector<int> d;
    for(int i=0; i<n-1; i++) d.push_back(a[i+1]-a[i]+1);
    sort(d.begin(),d.end());
    int ans=0;
    for(int i=0; i<max(0LL,n-k); i++) ans+=d[i];
    cout << ans+k-1;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t=1;
    // cin >> t;

    while(t--) {
        solve();
        cout << "\n";
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...