oj.uz

Submission #867455

# Submission time Handle Problem Language Result Execution time Memory
867455 2023-10-28T12:27:17 Z JoksimKaktus Stove (JOI18_stove) C++17
100 / 100
 19 ms 2992 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);
    int n,k;
    cin >> n >> k;
    vector <ll> v(n);
    for(int i = 0;i < n;i++){
        cin >> v[i];
    }
    ll res = v[n-1] - v[0]+1;
    vector <ll>v2(n-1);
    for(int i = 1;i < n;i++){
        v2[i-1] = v[i]-v[i-1]-1;
    }
    k--;
    std::sort(v2.begin(), v2.end());
    for(int i = n-2;i >= 0 && k > 0;i--){
        res -= v2[i];
        k--;
    }
    cout << res;
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 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 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 348 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 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 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 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 19 ms 2908 KB Output is correct
17 Correct 14 ms 2904 KB Output is correct
18 Correct 14 ms 2908 KB Output is correct
19 Correct 14 ms 2900 KB Output is correct
20 Correct 17 ms 2908 KB Output is correct
21 Correct 14 ms 2992 KB Output is correct
22 Correct 14 ms 2904 KB Output is correct
23 Correct 14 ms 2896 KB Output is correct
24 Correct 15 ms 2904 KB Output is correct