Submission #1285954

#TimeUsernameProblemLanguageResultExecution timeMemory
1285954timkaStove (JOI18_stove)C++20
100 / 100
18 ms2452 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;
    sort(a.begin(),a.end());
    int ans=a[n-1]-a[0]+1;
    vector<int> p;
    for(int i=0; i<n-1; i++) {
        p.push_back(a[i+1]-a[i]-1);
    }
    sort(p.rbegin(),p.rend());
    for(int i=0; i<k-1; i++) ans-=p[i];
    cout << ans;
}

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...