Submission #336821

#TimeUsernameProblemLanguageResultExecution timeMemory
336821aanjiStove (JOI18_stove)C++17
100 / 100
57 ms6380 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; void solve() { int n, k; cin >> n >> k; vector<int> t(n); multiset<int> x; cin >> t[0]; for (int i = 1; i < n; i++) { cin >> t[i]; x.insert(t[i] - t[i - 1] - 1); } int r = t[n - 1] - t[0] + 1; for (int i = 1; i < k; i++) { r -= *x.rbegin(); x.erase(prev(x.end())); } cout << r << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...