제출 #1333565

#제출 시각아이디문제언어결과실행 시간메모리
1333565justin271828Stove (JOI18_stove)C++20
100 / 100
41 ms1432 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, K;
  cin >> N >> K;
  int T[N];
  for (int i = 0; i < N; i++) cin >> T[i];
  int ans = T[N-1]-T[0]+1;
  priority_queue<int> pq;
  for (int i = 1; i < N; i++) pq.push(T[i]-T[i-1]-1);
  while (--K > 0) {
    ans -= pq.top();
    pq.pop();
  }
  cout << ans;
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...