Submission #427769

#TimeUsernameProblemLanguageResultExecution timeMemory
427769jk410Stove (JOI18_stove)C++17
100 / 100
28 ms2204 KiB
#include <bits/stdc++.h> using namespace std; int N,K,Ans; int T[100001]; priority_queue<int> Q; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>N>>K; Ans=N; for (int i=1; i<=N; i++){ cin>>T[i]; if (i>1) Q.push(-T[i]+T[i-1]+1); } K=N-K; while (K--){ Ans+=-Q.top(); Q.pop(); } cout<<Ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...