Submission #936318

#TimeUsernameProblemLanguageResultExecution timeMemory
936318DobromirAngelovStove (JOI18_stove)C++14
100 / 100
19 ms2420 KiB
#include<bits/stdc++.h> #define endl '\n' using namespace std; const int MAXN=1e5+5; int n,k; int a[MAXN]; priority_queue<int> pq; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); 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]-a[1]+1; while(--k) { ans-=pq.top(); pq.pop(); } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...