oj.uz

Submission #1105790

# Submission time Handle Problem Language Result Execution time Memory
1105790 2024-10-27T21:10:29 Z YouKnowCipher Stove (JOI18_stove) C++17
0 / 100
 1 ms 440 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long int

int32_t main () {
    int n, k;
    cin >> n >> k;
    vector<int> v(n), res(n - 1);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    for (int i = 1; i < n; i++) {
        res[i - 1] = v[i] - v[i - 1] - 1;
    }
    sort(res.begin(), res.end(), greater<int>());
    int cost = 0;
    for (int i = 0; i < k - 1; i++) {
        cost += res[i];
    }
    cout << max(n, *max_element(v.begin(), v.end()) - cost) << endl;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 440 KB Output is correct
2 Incorrect 1 ms 336 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 440 KB Output is correct
2 Incorrect 1 ms 336 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 440 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -