oj.uz

Submission #555046

# Submission time Handle Problem Language Result Execution time Memory
555046 2022-04-30T03:41:12 Z colossal_pepe Stove (JOI18_stove) C++17
100 / 100
 22 ms 2124 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n, k;
vector<int> times;
vector<int> diff;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    times.resize(n), diff.resize(n - 1);
    for (int &t : times) {
        cin >> t;
    }
    sort(times.begin(), times.end());
    for (int i = 0; i + 1 < n; i++) {
        diff[i] = times[i + 1] - times[i];
    }
    int ans = n;
    int k_req = n;
    sort(diff.rbegin(), diff.rend());
    while (k_req > k) {
        ans += diff.back() - 1;
        k_req--;
        diff.pop_back();
    }
    cout << ans << endl;
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 336 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 332 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 336 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 332 KB Output is correct
16 Correct 22 ms 2004 KB Output is correct
17 Correct 20 ms 1996 KB Output is correct
18 Correct 18 ms 2004 KB Output is correct
19 Correct 20 ms 2004 KB Output is correct
20 Correct 21 ms 2004 KB Output is correct
21 Correct 18 ms 2004 KB Output is correct
22 Correct 19 ms 1996 KB Output is correct
23 Correct 20 ms 2124 KB Output is correct
24 Correct 20 ms 1996 KB Output is correct