Submission #1133428

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133428		FZ_Laabidi	Stove (JOI18_stove)	C++20	0 / 100	0 ms	320 KiB

stove

#include <bits/stdc++.h>//
#define int long long
using namespace std;
void solve(){
    int n, k; cin >> n >>k;
    vector <int> v(n), gaps(n-1);
    for(int i = 0; i < n; i++)cin >> v[i];
    sort(v.begin(), v.end());
    if (n==k)
        cout << k<< endl;
    else if (k==1)
        cout << v[n-1]+1 << endl;
    int cur = n;
    for (int i=1; i<n; i++) {
        gaps[i-1]= v[i] - v[i-1];
        if (gaps[i-1]<2)gaps.pop_back();
    }
    sort(gaps.begin(), gaps.end());
    if (gaps.size()+1 > k){
        int tofil = k-gaps.size()+1;
        for (int i=0; i<tofil; i++)
            cur+=gaps[i]-1;
    }
    cout << cur << endl;
}

signed main(){
       solve();
}

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