Submission #777222

#TimeUsernameProblemLanguageResultExecution timeMemory
777222JoenPoenManStove (JOI18_stove)C++17
100 / 100
43 ms1648 KiB
#include <bits/stdc++.h>

using namespace std;


vector<int> pauses;

int main() {
    int N, K;
    cin >> N >> K;
    pauses.resize(N-1);
    int curr, prev, time = N;
    cin >> prev;
    for (int i = 0; i < N-1; i++) {
        cin >> curr;
        pauses[i] = curr - prev - 1;
        prev = curr;
    }    
    sort(pauses.begin(), pauses.end());
    for (int i = 0; K+i < N; i++) {
        time += pauses[i];
    }
    cout << time << endl;
    
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...