oj.uz

Submission #348302

# Submission time Handle Problem Language Result Execution time Memory
348302 2021-01-14T14:29:24 Z Halogen Stove (JOI18_stove) C++14
20 / 100
 2 ms 364 KB 
#include <bits/stdc++.h>

using namespace std;

main() {
    int N, K; scanf("%d %d", &N, &K);
    int lst[N + 5]; lst[0] = 0;
    for (int i = 1; i <= N; i++) scanf("%d", &lst[i]);
    priority_queue<int> pq;

    for (int i = 0; i < N; i++) {
        pq.push(lst[i + 1] - lst[i] - 1);
    }

    int ans = lst[N] - lst[1] + 1;

    for (int i = 1; i < K; i++) {
        // printf("%d\n", ans);
        ans -= pq.top(); pq.pop();
    }
    
    printf("%d", ans);
}

Compilation message

stove.cpp:5:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    5 | main() {
      |      ^
stove.cpp: In function 'int main()':
stove.cpp:6:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    6 |     int N, K; scanf("%d %d", &N, &K);
      |               ~~~~~^~~~~~~~~~~~~~~~~
stove.cpp:8:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    8 |     for (int i = 1; i <= N; i++) scanf("%d", &lst[i]);
      |                                  ~~~~~^~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Incorrect 2 ms 364 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Incorrect 2 ms 364 KB Output isn't correct
13 Halted 0 ms 0 KB -