# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
978240 |
2024-05-09T04:31:32 Z |
wateronenn |
Stove (JOI18_stove) |
C++17 |
|
1 ms |
348 KB |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+9;
int arr[N];
int main(){
cin.tie(0)->sync_with_stdio(false);
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
if(k==1){
cout<<(*max_element(arr+1,arr+n+1) - *min_element(arr+1,arr+n+1)+1);
return 0;
}
sort(arr+1,arr+n+1);
int mk = 1;
for(int i=1;i<=n;i++){
if(arr[i] - arr[i-1]>1) mk++;
}
if(mk>k) cout<<n+mk-k;
else cout<<n;
return 0;
}
/*
3 1
1
3
6
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |