Submission #1212487

#TimeUsernameProblemLanguageResultExecution timeMemory
1212487VMaksimoski008Stove (JOI18_stove)C++17
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; signed main() { int n, k; cin >> n >> k; vector<int> a(n+1); for(int i=1; i<=n; i++) cin >> a[i]; priority_queue<int> pq; int ans = a[n] - a[1] + 1; for(int i=1; i<n; i++) pq.push(a[i] - a[i-1] - 1); for(int i=0; i<k-1; i++) ans -= pq.top(), pq.pop(); cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...