Submission #1170935

#TimeUsernameProblemLanguageResultExecution timeMemory
1170935peemStove (JOI18_stove)C++20
100 / 100
35 ms996 KiB
#include <bits/stdc++.h> using namespace std; int n,k; int main() { cin>>n>>k; int sm=n; priority_queue <int> pq; int a,b; cin>>a; for(int i=1;i<n;++i) { cin>>b; pq.push(b-a-1); if(pq.size()>n-k) pq.pop(); a=b; } while(!pq.empty()) { sm+=pq.top(); pq.pop(); } cout<<sm; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...