Submission #1196540

#TimeUsernameProblemLanguageResultExecution timeMemory
1196540amanthabandStove (JOI18_stove)C++20
0 / 100
0 ms320 KiB
#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main() {
    int N, K;
    cin >> N >> K;
    
    vector<int> T(N);
    for (int i = 0; i < N; i++) {
        cin >> T[i];
    }
    
    int totalTime = 0;
    priority_queue<int> gaps;
    
    for (int i = 0; i < N - 1; i++) {
        totalTime += (T[i + 1] - T[i] - 1);
        gaps.push(T[i + 1] - T[i] - 1);
    }

    while (gaps.size() > K - 1) {
        totalTime -= gaps.top();
        gaps.pop();
    }
    
    cout << totalTime << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...