답안 #1092597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092597 2024-09-24T14:34:05 Z Flandre Stove (JOI18_stove) C++14
100 / 100
43 ms 2176 KB
#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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 30 ms 2136 KB Output is correct
17 Correct 30 ms 2144 KB Output is correct
18 Correct 31 ms 1968 KB Output is correct
19 Correct 31 ms 2144 KB Output is correct
20 Correct 32 ms 2176 KB Output is correct
21 Correct 43 ms 1972 KB Output is correct
22 Correct 34 ms 2144 KB Output is correct
23 Correct 30 ms 2136 KB Output is correct
24 Correct 30 ms 2136 KB Output is correct