oj.uz

Submission #998310

# Submission time Handle Problem Language Result Execution time Memory
998310 2024-06-13T15:27:04 Z Roman70 Stove (JOI18_stove) C++17
100 / 100
 44 ms 2776 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
    int n,k;
    cin >> n >> k;
    ll a[n];
    for(int i = 0;i<n;i++){
        cin >> a[i];
    }
    k--;
    ll ans = n;
    priority_queue<int>pq;
    
    
    for(int i = 1;i<n;i++){
        pq.push(a[i] - a[i-1] - 1);
    }
    
    while(pq.size() && k){
        k--;
        pq.pop();
    }
    
    while(pq.size()){
        ans += pq.top();
        pq.pop();
        
    }
    cout<<ans;
    
    
    
    


    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 432 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 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 480 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 35 ms 2776 KB Output is correct
17 Correct 38 ms 2768 KB Output is correct
18 Correct 36 ms 2776 KB Output is correct
19 Correct 37 ms 2768 KB Output is correct
20 Correct 34 ms 2764 KB Output is correct
21 Correct 38 ms 2764 KB Output is correct
22 Correct 39 ms 2768 KB Output is correct
23 Correct 35 ms 2768 KB Output is correct
24 Correct 44 ms 2764 KB Output is correct