Submission #1015531

#TimeUsernameProblemLanguageResultExecution timeMemory
1015531adkjtStove (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=1;i<=n;i++)
    pq.push(a[i]-a[i-1]-1);
   int ans=0;
   for(int i=n;i>k+1&&!pq.empty();i--){
    ans+=pq.top();
    pq.pop();
    }
    cout<<a[n]-ans<<'\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...