oj.uz

Submission #967815

# Submission time Handle Problem Language Result Execution time Memory
967815 2024-04-22T23:42:20 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 19 ms 2416 KB 
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>

using namespace std;
using ll = long long;

int main()
{
    priority_queue<ll> pq;
    int n, k;
    long long pre, curr, ans; scanf("%d %d %lld", &n, &k, &pre); ans = pre;
    if (n == k) return printf("%d", n), 0;
    for (int i = 1;i < n;i++){
        scanf("%lld", &curr);
        pq.push(curr-pre-1);
        pre = curr;
    }
    ans = curr-ans+1;
    while (--k){
        ans -= pq.top();
        pq.pop();
    }
    printf("%lld", ans);
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:13:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     long long pre, curr, ans; scanf("%d %d %lld", &n, &k, &pre); ans = pre;
      |                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf("%lld", &curr);
      |         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.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 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 360 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.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 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 360 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 448 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 492 KB Output is correct
15 Correct 1 ms 448 KB Output is correct

Subtask #3
50.0 / 50.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 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 360 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 448 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 492 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 10 ms 2368 KB Output is correct
17 Correct 13 ms 2268 KB Output is correct
18 Correct 11 ms 2260 KB Output is correct
19 Correct 11 ms 2416 KB Output is correct
20 Correct 15 ms 2260 KB Output is correct
21 Correct 18 ms 2288 KB Output is correct
22 Correct 19 ms 2260 KB Output is correct
23 Correct 19 ms 2260 KB Output is correct
24 Correct 19 ms 2260 KB Output is correct