Submission #1034839

#TimeUsernameProblemLanguageResultExecution timeMemory
1034839DeathIsAweStove (JOI18_stove)C++14
100 / 100
44 ms2356 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n,k; cin >> n >> k; k--;
    vector<int> times(n),timediffs;
    for (int i=0;i<n;i++) {
        cin >> times[i];
    }
    sort(times.begin(),times.end());
    for (int i=0;i<n-1;i++) {
        timediffs.push_back(times[i+1]-times[i]);
    }



    int ans = times[n-1] - times[0] + 1;
    sort(timediffs.begin(),timediffs.end(),greater<int>());
    for (int i=0;i<k;i++) {
        ans -= (timediffs[i]-1);
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...