oj.uz

Submission #1050722

# Submission time Handle Problem Language Result Execution time Memory
1050722 2024-08-09T13:25:04 Z fryingduc Stove (JOI18_stove) C++17
100 / 100
 12 ms 2288 KB 
#include "bits/stdc++.h"
using namespace std;

const int maxn = 1e5 + 5;

int n, k;
int a[maxn];
void solve() {
    cin >> n >> k;
    vector<int> b;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for(int i = 1; i < n; ++i) {
        b.push_back(a[i] - a[i + 1]);
    }
    sort(b.begin(), b.end());
    
    long long ans = a[n] - a[1] + k;
    for(int i = 0; i < k - 1; ++i) {
        ans += b[i];
    }
    
    cout << ans;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
    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 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 348 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 348 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 476 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 348 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 476 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 11 ms 2272 KB Output is correct
17 Correct 12 ms 2288 KB Output is correct
18 Correct 11 ms 2272 KB Output is correct
19 Correct 11 ms 2272 KB Output is correct
20 Correct 11 ms 2272 KB Output is correct
21 Correct 11 ms 2268 KB Output is correct
22 Correct 11 ms 2272 KB Output is correct
23 Correct 11 ms 2272 KB Output is correct
24 Correct 12 ms 2272 KB Output is correct