Submission #914349

#TimeUsernameProblemLanguageResultExecution timeMemory
914349LM1Stove (JOI18_stove)C++14
0 / 100
1 ms596 KiB
#include<bits/stdc++.h> using namespace std; const int N=1e5+5; int n,k,ans,t,t1; priority_queue<int>v; int main(){ cin>>n>>k; cin>>t1; ans=t1; for(int i=0;i<n-1;i++){ cin>>t; v.push(t-t1-1); t1=t; } ans=t-ans+1; k--;while(k--){ ans-=v.top(); v.pop(); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...