Submission #474264

#TimeUsernameProblemLanguageResultExecution timeMemory
474264R0L3eXStove (JOI18_stove)C++14
100 / 100
57 ms2328 KiB
#include <bits/stdc++.h>

using namespace std;

const int mxN = 16000;

int main() {

    int n, k; cin >> n >> k;
    vector<int> times(n);
    for(auto &x:times) cin >> x;
    vector<int> values;
    for(int i=1; i<n; ++i) values.push_back(times[i]-times[i-1]-1);
    sort(values.rbegin(), values.rend());
    int total=times[n-1]-times[0]+1;
    for(int i=0; i<k-1; ++i) total-=values[i];
    cout << total << "\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...