Submission #1257433

#TimeUsernameProblemLanguageResultExecution timeMemory
1257433kaitouStove (JOI18_stove)C++20
100 / 100
50 ms2240 KiB
#include <bits/stdc++.h>
using namespace std;
using L = long long;

int main(){
    int N, K;
    cin >> N >> K;
    vector <L> api(N);

    for(int i = 0; i < N; i++){
        cin >> api[i];
    }
    
    if(K >= N){
    cout << N;
    return 0;
    }
    vector <L> gaps;

    for(int i = 0; i < N-1; i++){
        L g= api[i+1] - api[i] - 1;
        gaps.push_back(g);
    }

    sort(gaps.begin(), gaps.end());

    L merge = N - K;

    L extra = 0;

    for (int i =0; i < merge; i++){
        extra += gaps[i];
    }

  L hasil = (L) N + extra;
    cout << hasil;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...