Submission #1303743

#	Time	Username	Problem	Language	Result	Execution time	Memory
1303743		Cr45hor	Stove (JOI18_stove)	C++17	0 / 100	1 ms	572 KiB

stove

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

using i64 = long long;

int const N = 1e5 + 5;

int n, k;
int T[N];
vector<int> gap;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        cin >> T[i];
    }

    for (int i = 0; i + 1 < n; i++) {
        if (T[i] + 2 < T[i + 1]) {
            gap.push_back(T[i + 1] - T[i] - 1);
        }
    }

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

    i64 res = T[n - 1] + 1 - T[0];
    for (int i = 0; i < min(k - 1, (int)gap.size()); i++) {
        res -= gap[i];
    }
    if ((int)gap.size() < k - 1) {
        res -= (i64)(k - 1 - gap.size());
    }

    cout << res << '\n';

    return 0;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 50