oj.uz

Submission #648179

# Submission time Handle Problem Language Result Execution time Memory
648179 2022-10-05T16:23:13 Z antete Stove (JOI18_stove) C++14
100 / 100
 53 ms 2216 KB 
#include <bits/stdc++.h>
//#define f first
//#define s second

typedef long long ll;
using namespace std;

int main()
{
    ll n, k;
    cin>>n>>k;
    ll m[n], a=n;
    for(ll i=0; i<n; i++){
        cin>>m[i];
    }
    sort(m, m+n);
    priority_queue<ll, vector<ll>, greater<ll>> q;
    for(ll i=1; i<n; i++){
        if(m[i]-m[i-1]>1){
            q.push(m[i]-m[i-1]-1);
        }
    }
    while(q.size()>k-1){
        a+=q.top();
        q.pop();
    }
    cout<<a;
    return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:23:19: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int, std::vector<long long int>, std::greater<long long int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   23 |     while(q.size()>k-1){
      |           ~~~~~~~~^~~~

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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 52 ms 2200 KB Output is correct
17 Correct 50 ms 2204 KB Output is correct
18 Correct 53 ms 2212 KB Output is correct
19 Correct 50 ms 2192 KB Output is correct
20 Correct 47 ms 2208 KB Output is correct
21 Correct 45 ms 2212 KB Output is correct
22 Correct 40 ms 2216 KB Output is correct
23 Correct 42 ms 2212 KB Output is correct
24 Correct 40 ms 2216 KB Output is correct