Submission #807115

#TimeUsernameProblemLanguageResultExecution timeMemory
807115annabeth9680Stove (JOI18_stove)C++17
100 / 100
42 ms2252 KiB
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
    int N,K; cin >> N >> K;
    vector<ll> arr(N);
    for(int i = 0;i<N;++i) cin >> arr[i];
    vector<ll> diff; ll ans = 0;
    for(int i = 0;i<N-1;++i){
        diff.push_back(arr[i+1]-arr[i]-1);
    }
    K--; ans = arr[N-1]-arr[0]+1;
    //cout << ans << "\n";
    sort(diff.begin(),diff.end()); int i = diff.size()-1;
    while(K > 0 && i >= 0){
        ans -= diff[i];
        K--; i--;
    }
    cout << ans << "\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...