oj.uz

Submission #1027178

# Submission time Handle Problem Language Result Execution time Memory
1027178 2024-07-19T01:44:14 Z kustizus Stove (JOI18_stove) C++17
100 / 100
 17 ms 3036 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5;
int n,k,t[N+5];
void Solve(){
    cin>>n>>k;
    t[0]=-1;
    int ans=n,d=n;
    vector <int> v;
    for (int i=1;i<=n;++i){
        cin>>t[i];
        if (i>1) v.push_back(t[i]-t[i-1]-1);
    }
    sort(v.begin(),v.end(),greater<int>());
    while (d>k){
        --d;
        ans+=v.back();
        v.pop_back();
    }
    cout<<ans;
}
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t=1;
	// cin>>t;
	while (t--) Solve();
}

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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 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 13 ms 3036 KB Output is correct
17 Correct 13 ms 3032 KB Output is correct
18 Correct 14 ms 3036 KB Output is correct
19 Correct 13 ms 3032 KB Output is correct
20 Correct 17 ms 3032 KB Output is correct
21 Correct 14 ms 3028 KB Output is correct
22 Correct 13 ms 3032 KB Output is correct
23 Correct 14 ms 3036 KB Output is correct
24 Correct 13 ms 3036 KB Output is correct