Submission #1093973

# Submission time Handle Problem Language Result Execution time Memory
1093973 2024-09-28T07:55:09 Z Flandre Stove (JOI18_stove) C++17
100 / 100
33 ms 2180 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;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 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 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 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 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 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 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 30 ms 2088 KB Output is correct
17 Correct 30 ms 1956 KB Output is correct
18 Correct 29 ms 2140 KB Output is correct
19 Correct 30 ms 2140 KB Output is correct
20 Correct 28 ms 2136 KB Output is correct
21 Correct 30 ms 2080 KB Output is correct
22 Correct 29 ms 2084 KB Output is correct
23 Correct 33 ms 2136 KB Output is correct
24 Correct 28 ms 2180 KB Output is correct