oj.uz

Submission #627133

# Submission time Handle Problem Language Result Execution time Memory
627133 2022-08-12T08:58:03 Z boris_mihov Stove (JOI18_stove) C++17
0 / 100
 1 ms 212 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>

typedef long long llong;
const int MAXN = 100000 + 10;
const int MAXLOG = 17;
const int INF  = 2e9;

int a[MAXN], n, k;
void solve()
{
    int max = a[1];
    std::sort(a+1, a+1+n);
    for (int i = n ; i >= 2 ; --i)
    {
        max = std::max(max, a[i]);
        a[i] -= a[i-1];
        a[i]--;
    }

    int sum = 0;
    std::sort(a+2, a+1+n); --k;
    for (int i = n ; i >= n - k + 1 ; --i)
    {
        sum += a[i];
    }

    std::cout << max - sum << '\n';
}

void read()
{
    std::cin >> n >> k;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> a[i];
    }
}

void fastIO()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIO();
    read();
    solve();

    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -