# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
967616 |
2024-04-22T14:05:34 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
24 ms |
1504 KB |
#include <bits/stdc++.h>
using namespace std;
int n, k, arr[100010], ans;
priority_queue<int> pq;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> k;
k--;
for(int i=0; i<n; i++) {
cin >> arr[i];
}
sort(arr, arr+n);
for(int i=1; i<n; i++) {
pq.push(arr[i]-arr[i-1]-1);
}
ans = arr[n-1] - arr[0]+1;
while(k--) {
ans -= pq.top();
pq.pop();
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 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 |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 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 |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 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 |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 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 |
10 ms |
1504 KB |
Output is correct |
17 |
Correct |
12 ms |
1500 KB |
Output is correct |
18 |
Correct |
11 ms |
1500 KB |
Output is correct |
19 |
Correct |
11 ms |
1504 KB |
Output is correct |
20 |
Correct |
15 ms |
1504 KB |
Output is correct |
21 |
Correct |
18 ms |
1504 KB |
Output is correct |
22 |
Correct |
19 ms |
1504 KB |
Output is correct |
23 |
Correct |
24 ms |
1504 KB |
Output is correct |
24 |
Correct |
19 ms |
1504 KB |
Output is correct |