Submission #1015544

#TimeUsernameProblemLanguageResultExecution timeMemory
1015544adkjtStove (JOI18_stove)C++14
0 / 100
0 ms348 KiB
#include<bits/stdc++.h> using namespace std; priority_queue<int> pq; int a[111111]; int main() { int n,k;cin>>n>>k; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=2;i<=n;i++) pq.push(a[i]-a[i-1]-1); int ans=a[n]; int cnt=0; while(cnt<k-1){ ans-=pq.top(); //cout<<pq.top()<<'\n'; pq.pop(); cnt++; } cout<<ans<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...