oj.uz

Submission #561186

# Submission time Handle Problem Language Result Execution time Memory
561186 2022-05-12T12:44:54 Z Bobonbush Stove (JOI18_stove) C++17
100 / 100
 23 ms 2164 KB 
#include <bits/stdc++.h>
#define foreach for
#define in :
using namespace std;
typedef long long ll;

/*
Konichiwa
Konichiwa
Ara ~~ ara

Bob no taisuki - Shinobu Kocho
    * * * * *
  *          *
 *         *
*         *        I love SHINOBU <3 <3 <3
 *         *
  *          *
    * * * * *
*/

/*
_________________________


    Author : Bob15324

_________________________
*/

template<class X , class Y>
    bool Minimize(X & x , Y y)
    {
        if(x == -1 || x >y)
        {
            x = y;
            return true;
        }
        return false;
    }

template<class X , class Y>
    bool Maximize(X & x , Y y)
    {
        if( x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

/* End of templates. Let's see what do we have here */
const int N = 1e5+1;
int  n , k;
int a[N];
int main()
{
    ios_base :: sync_with_stdio(0);cin.tie(0);
    cin >> n >> k;
    int kay = n;
    int res =  n;
    priority_queue<int , vector<int> , greater<int> >pq;
    for(int i = 1 ; i <= n ; i++)
    {
        cin >> a[i];
        if(i > 1)
        {
            pq.push(a[i] - a[i-1] - 1);
        }
    }
    while(kay > k && !pq.empty())
    {
        res += pq.top();
        pq.pop();
        kay--;
    }
    cout << res ;


    return 0;
}

//Ehem. My code is amazing. Pay me 2$.Thank you.

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 328 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 328 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 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 328 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 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 23 ms 2132 KB Output is correct
17 Correct 23 ms 2136 KB Output is correct
18 Correct 22 ms 2120 KB Output is correct
19 Correct 23 ms 2132 KB Output is correct
20 Correct 21 ms 2156 KB Output is correct
21 Correct 14 ms 2100 KB Output is correct
22 Correct 13 ms 2104 KB Output is correct
23 Correct 13 ms 2164 KB Output is correct
24 Correct 14 ms 2132 KB Output is correct