oj.uz

Submission #891841

# Submission time Handle Problem Language Result Execution time Memory
891841 2023-12-24T08:22:26 Z hennessey Stove (JOI18_stove) C++17
100 / 100
 43 ms 3600 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

signed main() {
    //your code goes here
    int n, k;
    cin >> n >> k;
    vector <int> arr = {};
    for(int i = 0; i < n; i++) {
        int num;
        cin >> num;
        arr.push_back(num);
    }
    int sum = 1;
    k--;
    vector <int> arr2 = {};
    for(int i = 0; i < n-1; i++) {
        arr2.push_back(arr[i+1]-arr[i]);
        sum += arr[i+1]-arr[i];
    }
    sort(arr2.begin(), arr2.end(), greater<int>());
    for(int i = 0; i < k; i++) {
        sum -= arr2[i];
    }
    sum += k;
    cout << sum << endl;
    return 0;
}

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 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 0 ms 344 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 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 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 444 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 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 444 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 35 ms 3460 KB Output is correct
17 Correct 35 ms 3600 KB Output is correct
18 Correct 35 ms 3536 KB Output is correct
19 Correct 34 ms 3536 KB Output is correct
20 Correct 35 ms 3572 KB Output is correct
21 Correct 43 ms 3524 KB Output is correct
22 Correct 35 ms 3524 KB Output is correct
23 Correct 34 ms 3524 KB Output is correct
24 Correct 35 ms 3524 KB Output is correct