Submission #291601

#TimeUsernameProblemLanguageResultExecution timeMemory
291601reymontada61Stove (JOI18_stove)C++14
100 / 100
98 ms2384 KiB
#include <bits/stdc++.h> using namespace std; const int MXN = 100005; int n, k; int t[MXN]; signed main() { cin >> n >> k; for (int i=0; i<n; i++) cin >> t[i]; sort(t, t+n); int full = t[n-1] + 1 - t[0]; k--; vector<int> gaps; for (int i=1; i<n; i++) { gaps.push_back(t[i] - t[i-1] - 1); } sort(gaps.begin(), gaps.end(), greater<int>()); int ove = 0; for (int i=0; i<min((int) gaps.size(), k); i++) ove += gaps[i]; cout << full - ove << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...