Submission #1359793

#TimeUsernameProblemLanguageResultExecution timeMemory
1359793trin1506Stove (JOI18_stove)C++20
20 / 100
0 ms344 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,k;
    cin >> n >> k;
    vector<ll> a(n);
    priority_queue<ll,vector<ll>,greater<ll>> pq;
    cin >> a[0];
    ll cnt=0;
    for(ll i=1;i<n;i++){
        cin >> a[i];
        if(pq.empty())pq.push(a[i]-a[i-1]-1);
        else if(a[i]-a[i-1]-1>pq.top())pq.push(a[i]-a[i-1]-1);
        if(pq.size()>k-1)pq.pop();
    }
    cnt = a[n-1]+1-a[0];
    while(!pq.empty()){
        ll best = pq.top();
        cnt-=best;
        pq.pop();
    }
    cout << cnt;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...