Submission #967651

#TimeUsernameProblemLanguageResultExecution timeMemory
967651jadai007Stove (JOI18_stove)C++17
100 / 100
21 ms2272 KiB
#include<bits/stdc++.h> using namespace std; priority_queue<int> pq; int n, k, T[100100], ans; int main(){ cin.tie(nullptr)->sync_with_stdio(false); cin >> n >> k; for(int i = 1; i<=n; ++i) cin >> T[i]; sort(T+1, T+1+n); k--; for(int i = 2; i<=n; ++i) pq.push(T[i] - T[i - 1] - 1); ans = T[n] - T[1] + 1; while(k--){ ans-=pq.top(); pq.pop(); } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...