Submission #1172511

#TimeUsernameProblemLanguageResultExecution timeMemory
1172511versesrevStove (JOI18_stove)C++20
0 / 100
0 ms320 KiB
// 20:56
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>

int main () {
  int n, k;
  std::cin >> n >> k;
  std::vector<int> ts(n, 0);
  for (int& t : ts) std::cin >> t;
  
  std::vector<int> ds;
  std::adjacent_difference(ts.begin(), ts.end(), std::back_inserter(ds));
  std::ranges::sort(ds, std::greater<int>());
  
  int ans = ts[n - 1] - ts[0] + 1;
  for (int i = 0; i < k; ++i) ans -= ds[i];
  
  std::cout << ans << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...