# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
978249 |
2024-05-09T04:47:17 Z |
wateronenn |
Stove (JOI18_stove) |
C++14 |
|
1 ms |
344 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];
}
int all = n+1;
priority_queue<int> pq;
sort(arr+1,arr+n+1);
for(int i=2;i<=n;i++) pq.push(arr[i]-arr[i-1]);
for(int i=1;i<k;i++){
all-=pq.top();
pq.pop();
}
cout<<all;
return 0;
}
/*
3 1
1
3
6
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |