제출 #1201049

#제출 시각아이디문제언어결과실행 시간메모리
1201049zNatsumiStove (JOI18_stove)C++20
100 / 100
11 ms1096 KiB
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, k, res = 0, t[N], d[N];

int32_t main(){
  cin.tie(0)->sync_with_stdio(0);
//  #define task "test"
//  if(fopen(task ".inp", "r")){
//    freopen(task ".inp", "r", stdin);
//    freopen(task ".out", "w", stdout);
//  }
  cin >> n >> k;
  for(int i = 1; i <= n; i++) cin >> t[i];
  for(int i = 1; i < n; i++) d[i] = t[i + 1] - t[i];

  sort(d + 1, d + n);
  for(int i = 1; i <= n - k; i++) res += d[i];
  cout << res + k << "\n";

  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...