Submission #453644

#	Time	Username	Problem	Language	Result	Execution time	Memory
453644		ponytail	Stove (JOI18_stove)	C++17	100 / 100	30 ms	2308 KiB

stove

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
void solve(){
    int N, K;cin >> N >> K;
    int T[N+1]; for(int i=1; i<=N; i++) cin >> T[i];
    if(N == 1){
        cout << "1\n";
        return;
    }
    else if(K == 1){
        cout << T[N] + 1 - T[1] << "\n";
        return;
    }
    priority_queue<int> pq;
    for(int i=1; i<N; i++) {
        pq.push(T[i+1] - T[i] - 1);
    }
    int ans = T[N] + 1 - T[1];
    for(int i=1; i<K; i++){
        ans -= pq.top();
        pq.pop();
    }
    cout << ans << endl;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;// cin >> t;
    while(t--) solve();
}

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