oj.uz

Submission #1037020

# Submission time Handle Problem Language Result Execution time Memory
1037020 2024-07-27T22:07:06 Z ArthuroWich Stove (JOI18_stove) C++17
100 / 100
 17 ms 3292 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long int
void solve() {
    int n, k, ans = 0;
    cin >> n >> k;
    vector<int> a(n);
    for (int &x : a) {
        cin >> x;
    }
    ans += a.back()+1-a.front();
    vector<int> diff;
    for (int i = 1; i < n; i++) {
        if (max(0LL, a[i]-a[i-1]-1) != 0) {
            diff.push_back(a[i]-a[i-1]-1);
        }
    }
    k--;
    sort(diff.rbegin(), diff.rend());
    for (int i = 0; i < min(k, (int)diff.size()); i++) {
        ans -= diff[i];
    }
    cout << ans << endl;
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while(t--) {
        solve();
    }
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 576 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 576 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 13 ms 3292 KB Output is correct
17 Correct 12 ms 3288 KB Output is correct
18 Correct 17 ms 3288 KB Output is correct
19 Correct 12 ms 3292 KB Output is correct
20 Correct 12 ms 3136 KB Output is correct
21 Correct 15 ms 3156 KB Output is correct
22 Correct 14 ms 3292 KB Output is correct
23 Correct 12 ms 3292 KB Output is correct
24 Correct 12 ms 3156 KB Output is correct