oj.uz

Submission #921895

# Submission time Handle Problem Language Result Execution time Memory
921895 2024-02-04T13:06:49 Z bean Stove (JOI18_stove) C++17
100 / 100
 20 ms 2140 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int &x : a) cin >> x;
    int ans = a[n - 1] - a[0] + 1;
    vector<int> b(n - 1);
    for (int i = 0; i < n - 1; i++) {
        b[i] = a[i + 1] - a[i] - 1;
    }
    sort(b.begin(), b.end(), greater<>());
    for (int i = 0; i < k - 1; i++) {
        ans -= b[i];
    }
    cout << ans;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int tt = 1;
    // cin >> tt;

    while (tt--) {
        solve();
    }

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 472 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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 472 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 14 ms 2128 KB Output is correct
17 Correct 15 ms 2140 KB Output is correct
18 Correct 14 ms 2136 KB Output is correct
19 Correct 14 ms 2140 KB Output is correct
20 Correct 15 ms 2140 KB Output is correct
21 Correct 20 ms 2000 KB Output is correct
22 Correct 16 ms 2000 KB Output is correct
23 Correct 16 ms 1992 KB Output is correct
24 Correct 18 ms 2004 KB Output is correct