Submission #564065

#TimeUsernameProblemLanguageResultExecution timeMemory
564065Trisanu_DasStove (JOI18_stove)C++17
100 / 100
65 ms2196 KiB
#include <bits/stdc++.h>
using namespace std;
 
// difficulty: cakewalk if u know there is a thing called priority queue
 
int main(){
  int n, k; cin >> n >> k;
  priority_queue<int, vector<int>, greater<int> >  times;
  int a[n];
  int ans = n;
  for(int i = 0; i < n; i++){
    cin >> a[i];
    if(i > 0) times.push(a[i] - a[i - 1] - 1);
  }
  k = n - k;
  while(k > 0 && !times.empty()){
    ans += times.top(); times.pop(); k--;
  }
  cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...