# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
919441 |
2024-01-31T18:41:44 Z |
Keys |
Stove (JOI18_stove) |
C++14 |
|
21 ms |
3368 KB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
signed main(){
ios::sync_with_stdio(0);cin.tie(0);
int n,k;cin>>n>>k;vector<int>a(n);for(auto&i:a)cin>>i;
sort(all(a));
vector<int>d;for(int i=1;i<n;i++)d.push_back(max(0ll,a[i]-a[i-1]-1));
sort(all(d)); reverse(all(d));
int sub=0;for(int i=0;i<min(k-1,n-1);i++)sub+=d[i];
cout<<a.back()-a[0]-sub+1<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
1 ms |
344 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
460 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
1 ms |
344 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
460 KB |
Output is correct |
16 |
Correct |
17 ms |
3276 KB |
Output is correct |
17 |
Correct |
21 ms |
3288 KB |
Output is correct |
18 |
Correct |
16 ms |
3288 KB |
Output is correct |
19 |
Correct |
20 ms |
3284 KB |
Output is correct |
20 |
Correct |
18 ms |
3288 KB |
Output is correct |
21 |
Correct |
16 ms |
3368 KB |
Output is correct |
22 |
Correct |
17 ms |
3272 KB |
Output is correct |
23 |
Correct |
17 ms |
3284 KB |
Output is correct |
24 |
Correct |
18 ms |
3284 KB |
Output is correct |