Submission #837534

#	Time	Username	Problem	Language	Result	Execution time	Memory
837534		Koyote	Stove (JOI18_stove)	C++11	100 / 100	18 ms	2132 KiB

stove

#include <bits/stdc++.h>
using namespace std;

const int maxN = 1e5 + 2;
int n, k, a[maxN], b[maxN];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (i > 0) b[i - 1] = (a[i] - a[i - 1]) - 1;
    }
    sort(b, b + n - 1, greater<int>());
    cout << (a[n - 1] - a[0] + 1) - accumulate(b, b + k - 1, 0LL) << '\n';
}

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