Submission #206255

#TimeUsernameProblemLanguageResultExecution timeMemory
206255hhh07Stove (JOI18_stove)C++14
100 / 100
76 ms3056 KiB
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main(){
  int n, k;
  cin >> n >> k;
  long long t[n];
  vector<long long> r;
  long long res = 0;
  for (int i = 0; i < n; i++){
    cin >> t[i];
    if (i > 0)
      r.push_back(t[i] - t[i - 1]);
  }

  sort(r.begin(), r.end());
  for (int i = 0 ; i < n - k; i++){
    res += r[i];
  }

  cout << res + k << endl;
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...