oj.uz

Submission #557002

# Submission time Handle Problem Language Result Execution time Memory
557002 2022-05-04T14:31:36 Z Ai7081 Stove (JOI18_stove) C++17
100 / 100
 27 ms 2256 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

priority_queue<int> pq;
int n, k, a[N], ans;

int main() {
    scanf(" %d %d", &n, &k);
    for (int i=0; i<n; i++) scanf(" %d", &a[i]);
    for (int i=0; i<n-1; i++) {
        pq.push(a[i+1] - a[i] - 1);
    }
    ans = a[n-1] - a[0] + 1;
    while (--k) ans -= pq.top(), pq.pop();
    printf("%d", ans);
    return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf(" %d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
stove.cpp:11:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     for (int i=0; i<n; i++) scanf(" %d", &a[i]);
      |                             ~~~~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 2 ms 340 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 13 ms 2236 KB Output is correct
17 Correct 14 ms 2228 KB Output is correct
18 Correct 15 ms 2256 KB Output is correct
19 Correct 15 ms 2232 KB Output is correct
20 Correct 23 ms 2248 KB Output is correct
21 Correct 26 ms 2196 KB Output is correct
22 Correct 27 ms 2256 KB Output is correct
23 Correct 24 ms 2232 KB Output is correct
24 Correct 24 ms 2248 KB Output is correct