oj.uz

Submission #1086535

# Submission time Handle Problem Language Result Execution time Memory
1086535 2024-09-11T01:56:39 Z UNOwen07 Stove (JOI18_stove) C++17
100 / 100
 13 ms 3064 KB 
#include <bits/stdc++.h>
using namespace std;

long long n, k, arr[100005], sum;
priority_queue<long long> q;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> k;
    long long tam = n-k;
    sum = n;
    cin >> arr[1];
    for (int i = 2; i <= n; i++){
        cin >> arr[i];
        long long dif = arr[i]-arr[i-1]-1;
        sum += dif;
        q.push(dif);
        if (q.size() > tam){
            sum -= q.top();
            q.pop();
        }
    }
    cout << sum;
    return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:19:22: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   19 |         if (q.size() > tam){
      |             ~~~~~~~~~^~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 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 348 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 476 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 476 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 9 ms 3036 KB Output is correct
17 Correct 9 ms 3036 KB Output is correct
18 Correct 10 ms 3064 KB Output is correct
19 Correct 10 ms 3036 KB Output is correct
20 Correct 12 ms 2704 KB Output is correct
21 Correct 12 ms 2396 KB Output is correct
22 Correct 12 ms 2080 KB Output is correct
23 Correct 13 ms 2140 KB Output is correct
24 Correct 8 ms 2140 KB Output is correct