Submission #395755

#TimeUsernameProblemLanguageResultExecution timeMemory
395755kaplanbarStove (JOI18_stove)C++14
100 / 100
21 ms2764 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, k;
    cin >> n >> k;

    if(k == n) {
        cout << n;
        exit(0);
    }

    vector<int> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }

    ll s = 0;
    vector<ll> difs;
    for(int i = 1; i < n; i++) {
        s += v[i] - v[i - 1];
        difs.push_back(v[i] - v[i - 1]);
    }

    sort(difs.begin(), difs.end());

    for(int i = 0; i < k - 1; i++) {
        s -= difs[n - 2 - i];
    }

    cout << s + k;


    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...