oj.uz

Submission #819148

# Submission time Handle Problem Language Result Execution time Memory
819148 2023-08-10T08:13:01 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 18 ms 1492 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define se second
#define fi first
#define pii pair<int,int>
#define pll pair<long long, long long>

ll k, n, fin, start, pirst;
vector<ll> duration;

void solve(){
    cin >> n >> k;
    cin >> start;
    pirst=start;
    if(n==1){
        cout << 1 << endl;
        return;
    }
    for(int i=1; i<n; i++){
        cin >> fin;
        duration.push_back(fin-start);
        start=fin;
    }
    fin-=(pirst-1);
    sort(duration.begin(), duration.end(), greater());
    k--;
    for(int i=0; i<k; i++){
        fin-=(duration[i]-1);
    }
    cout << fin << endl;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    solve();
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 16 ms 1492 KB Output is correct
17 Correct 14 ms 1492 KB Output is correct
18 Correct 14 ms 1492 KB Output is correct
19 Correct 17 ms 1444 KB Output is correct
20 Correct 15 ms 1492 KB Output is correct
21 Correct 14 ms 1492 KB Output is correct
22 Correct 15 ms 1492 KB Output is correct
23 Correct 16 ms 1364 KB Output is correct
24 Correct 18 ms 1376 KB Output is correct