Submission #1037020

#TimeUsernameProblemLanguageResultExecution timeMemory
1037020ArthuroWichStove (JOI18_stove)C++17
100 / 100
17 ms3292 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long int
void solve() {
    int n, k, ans = 0;
    cin >> n >> k;
    vector<int> a(n);
    for (int &x : a) {
        cin >> x;
    }
    ans += a.back()+1-a.front();
    vector<int> diff;
    for (int i = 1; i < n; i++) {
        if (max(0LL, a[i]-a[i-1]-1) != 0) {
            diff.push_back(a[i]-a[i-1]-1);
        }
    }
    k--;
    sort(diff.rbegin(), diff.rend());
    for (int i = 0; i < min(k, (int)diff.size()); i++) {
        ans -= diff[i];
    }
    cout << ans << endl;
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while(t--) {
        solve();
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...