oj.uz

Submission #453644

# Submission time Handle Problem Language Result Execution time Memory
453644 2021-08-04T13:39:23 Z ponytail Stove (JOI18_stove) C++17
100 / 100
 30 ms 2308 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
void solve(){
    int N, K;cin >> N >> K;
    int T[N+1]; for(int i=1; i<=N; i++) cin >> T[i];
    if(N == 1){
        cout << "1\n";
        return;
    }
    else if(K == 1){
        cout << T[N] + 1 - T[1] << "\n";
        return;
    }
    priority_queue<int> pq;
    for(int i=1; i<N; i++) {
        pq.push(T[i+1] - T[i] - 1);
    }
    int ans = T[N] + 1 - T[1];
    for(int i=1; i<K; i++){
        ans -= pq.top();
        pq.pop();
    }
    cout << ans << endl;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;// cin >> t;
    while(t--) solve();
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 328 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 16 ms 2296 KB Output is correct
17 Correct 16 ms 2308 KB Output is correct
18 Correct 17 ms 2300 KB Output is correct
19 Correct 19 ms 2220 KB Output is correct
20 Correct 22 ms 2220 KB Output is correct
21 Correct 27 ms 2224 KB Output is correct
22 Correct 27 ms 2216 KB Output is correct
23 Correct 29 ms 2220 KB Output is correct
24 Correct 30 ms 2276 KB Output is correct