oj.uz

Submission #997287

# Submission time Handle Problem Language Result Execution time Memory
997287 2024-06-12T02:29:11 Z Icelast Stove (JOI18_stove) C++17
100 / 100
 16 ms 3544 KB 
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;
void solve(){
    ll n, k;
    cin >> n >> k;
    vector<ll> a(n+1), b;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    ll ans = a[n]-a[1]+1;
    for(int i = 2; i <= n; i++){
        b.push_back(a[i]-a[i-1]-1);
    }
    k--;
    sort(b.begin(), b.end(), greater<ll>());
    for(int i = 0; i < k; i++){
        ans -= b[i];
    }
    cout << ans;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
}

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 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 0 ms 344 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 1 ms 348 KB Output is correct
12 Correct 1 ms 472 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 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 1 ms 348 KB Output is correct
12 Correct 1 ms 472 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 14 ms 3368 KB Output is correct
17 Correct 15 ms 3292 KB Output is correct
18 Correct 14 ms 3292 KB Output is correct
19 Correct 14 ms 3544 KB Output is correct
20 Correct 16 ms 3292 KB Output is correct
21 Correct 14 ms 3292 KB Output is correct
22 Correct 15 ms 3296 KB Output is correct
23 Correct 13 ms 3288 KB Output is correct
24 Correct 15 ms 3292 KB Output is correct