Submission #1257916

#TimeUsernameProblemLanguageResultExecution timeMemory
1257916random_nameStove (JOI18_stove)C++20
100 / 100
30 ms1864 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ll n, k;
    cin >> n >> k;
    k--;

    vector<ll> A(n);
    for(ll i = 0; i < n; i++){
        cin >> A[i];
    }
    sort(A.begin(), A.end());

    vector<ll> B(n-1);
    for(ll i = 0; i < n-1; i++){
        B[i] = (A[i+1] - A[i] - 1);
    }

    sort(B.begin(), B.end(), greater<ll>());

    ll res = 0;
    for(ll i = 0; i < k;i++){
        res += B[i];
    }

    cout << A.back() - A.front() + 1 - res << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...