제출 #749321

#제출 시각아이디문제언어결과실행 시간메모리
749321tch1cherinStove (JOI18_stove)C++17
100 / 100
46 ms2044 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, K;
  cin >> N >> K;
  vector<int> T(N);
  for (int &v : T) {
    cin >> v;
  }
  vector<int> D(N - 1);
  for (int i = 0; i < N - 1; i++) {
    D[i] = T[i + 1] - T[i] - 1;
  }
  sort(D.rbegin(), D.rend());
  cout << T[N - 1] - T[0] + 1 - accumulate(D.begin(), D.begin() + K - 1, 0) << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...