Submission #1264218

#TimeUsernameProblemLanguageResultExecution timeMemory
1264218Elephant52Stove (JOI18_stove)C++20
100 / 100
12 ms1096 KiB
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
const int INF = 1000000000;

int N, K;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> N >> K;
    vector<int> t(N);
    for (int &i : t) {
        cin >> i;
    }

    vector<int> diffs(N - 1);
    for (int i = 0; i+1 < N; ++i) {
        diffs[i] = t[i+1] - (t[i]+1);
    }

    sort(diffs.begin(), diffs.end(), greater<int>());

    int ans = t.back() + 1 - t.front();
    for (int i = 0; i < K-1; ++i) {
        ans -= diffs[i];
    }

    cout << ans << '\n';

    return 0;
}

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