oj.uz

Submission #348305

# Submission time Handle Problem Language Result Execution time Memory
348305 2021-01-14T14:31:33 Z Halogen Stove (JOI18_stove) C++14
100 / 100
 31 ms 3172 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

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

    for (int i = 1; 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("%lld\n", ans);
        ans -= pq.top(); pq.pop();
    }
    
    printf("%lld", ans);
}

Compilation message

stove.cpp:7:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    7 | main() {
      |      ^
stove.cpp: In function 'int main()':
stove.cpp:8:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    8 |     int N, K; scanf("%lld %lld", &N, &K);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~~~
stove.cpp:10:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |     for (int i = 1; i <= N; i++) scanf("%lld", &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 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct

Subtask #2
30.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 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 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 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #3
50.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 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 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 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 18 ms 2276 KB Output is correct
17 Correct 18 ms 2276 KB Output is correct
18 Correct 20 ms 2276 KB Output is correct
19 Correct 19 ms 2276 KB Output is correct
20 Correct 24 ms 3172 KB Output is correct
21 Correct 29 ms 3172 KB Output is correct
22 Correct 31 ms 3172 KB Output is correct
23 Correct 30 ms 3172 KB Output is correct
24 Correct 30 ms 3172 KB Output is correct