Submission #978260

#TimeUsernameProblemLanguageResultExecution timeMemory
978260YABYABStove (JOI18_stove)C++17
100 / 100
46 ms2516 KiB
#include<bits/stdc++.h> using namespace std; int main() { int n,k; cin >> n >> k; int ll[n]; for(int i = 0; i < n; i++){ cin >> ll[i]; } priority_queue<int> pq; for(int i = 0; i < n-1; i++){ pq.push(ll[i+1]-ll[i]-1); } k--; int ans = ll[n-1] - ll[0] +1; while(k>0 && !pq.empty() && pq.top() > 0){ ans-=pq.top(); pq.pop(); k--; } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...