Submission #988285

#	Time	Username	Problem	Language	Result	Execution time	Memory
988285		Wane	Stove (JOI18_stove)	C++14	100 / 100	43 ms	3372 KiB

stove

#include <bits/stdc++.h>

using namespace std;
#define int long long

int N, K;
int T[100001];

signed main() {

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

    int to_connect = N - K;
    priority_queue<int, vector<int>, greater<int> > pq;
    for (int i = 1; i < N; i++) {
        pq.push(T[i] - T[i - 1]);
    }

    int ans = N;
    while (to_connect) {
        ans += pq.top() - 1;
        pq.pop();
        to_connect--;
    }
    cout << ans << '\n';
}

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