Submission #311215

#TimeUsernameProblemLanguageResultExecution timeMemory
311215MilosMilutinovicStove (JOI18_stove)C++14
100 / 100
57 ms6436 KiB
/** * author: milos * created: 09.10.2020 18:35:57 **/ #include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a.begin(), a.end()); int ans = a[n - 1] - a[0] + 1; multiset<int> s; for (int i = 0; i < n - 1; i++) { s.insert(a[i + 1] - a[i] - 1); } for (int i = 0; i < k - 1; i++) { if (s.empty()) { break; } auto it = prev(s.end()); ans -= *it; s.erase(it); } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...