Submission #1092377

#TimeUsernameProblemLanguageResultExecution timeMemory
1092377FlandreStove (JOI18_stove)C++17
100 / 100
35 ms2140 KiB
#include <bits/stdc++.h>
using namespace std;
 
#define ui unsigned int
 
int main() {
  int N, K; // K is matches
  cin >> N >> K;
 
  ui wastes[N - 1];
  ui t[N];
 
  cin >> t[0];
  for (int i = 1; i < N; i++) {
    cin >> t[i];
    wastes[i-1] = t[i] - t[i-1] - 1;
  }
 
  sort(wastes, wastes+N-1);
 
  ui totalwaste = 0;
  for (int i = 0; i < N - K; i++) {
    totalwaste += wastes[i];
  }
 
  cout << N + totalwaste << endl;
 
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...