Submission #146923

#TimeUsernameProblemLanguageResultExecution timeMemory
146923willi19Stove (JOI18_stove)C++14
100 / 100
94 ms3356 KiB
#include <bits/stdc++.h> int n,k; long long t[100100],ans; using namespace std; priority_queue<long long> pq; int main() { cin>>n>>k; for(int i=0;i<n;i++) cin>>t[i]; sort(t,t+n); ans=t[n-1]+1-t[0]; for(int i=0;i<n-1;i++) pq.push(t[i+1]-t[i]-1); k--; while(!pq.empty()&&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...