oj.uz

Submission #889236

# Submission time Handle Problem Language Result Execution time Memory
889236 2023-12-19T08:28:49 Z alexander707070 Stove (JOI18_stove) C++14
100 / 100
 43 ms 2332 KB 
#include<bits/stdc++.h>
#define MAXN 100007
using namespace std;

int n,k;
int t[MAXN],ans;
vector<int> diff;

int main(){

    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>t[i];
    }
    ans=t[n]+1-t[1];

    for(int i=2;i<=n;i++){
        diff.push_back(t[i]-(t[i-1]+1));
    }

    sort(diff.begin(),diff.end());
    reverse(diff.begin(),diff.end());

    for(int i=0;i<k-1;i++){
        ans-=diff[i];
    }

    cout<<ans<<"\n";

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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 2 ms 344 KB Output is correct
12 Correct 1 ms 344 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 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 2 ms 344 KB Output is correct
12 Correct 1 ms 344 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 34 ms 2256 KB Output is correct
17 Correct 33 ms 2264 KB Output is correct
18 Correct 34 ms 2332 KB Output is correct
19 Correct 43 ms 2260 KB Output is correct
20 Correct 38 ms 2256 KB Output is correct
21 Correct 34 ms 2212 KB Output is correct
22 Correct 33 ms 2208 KB Output is correct
23 Correct 33 ms 2320 KB Output is correct
24 Correct 33 ms 2260 KB Output is correct