# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1033724 |
2024-07-25T04:26:20 Z |
vjudge1 |
Stove (JOI18_stove) |
C++14 |
|
18 ms |
3416 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
cin.tie(nullptr) -> sync_with_stdio(0);
int n, k;
cin >> n >> k;
priority_queue<int> pq;
vector<int> t(n+5);
for (int i = 1; i <= n; i++){
cin >> t[i];
}
for (int i = 2; i <= n; i++){
pq.push(t[i] - t[i-1] - 1);
}
k--;
int ans = t[n] - t[1] + 1;
while(!pq.empty() && k){
ans -= pq.top();
pq.pop();
k--;
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 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 |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
468 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
1 ms |
600 KB |
Output is correct |
14 |
Correct |
1 ms |
600 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 |
1 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 |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
468 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
1 ms |
600 KB |
Output is correct |
14 |
Correct |
1 ms |
600 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
9 ms |
3288 KB |
Output is correct |
17 |
Correct |
13 ms |
3416 KB |
Output is correct |
18 |
Correct |
9 ms |
3292 KB |
Output is correct |
19 |
Correct |
10 ms |
3280 KB |
Output is correct |
20 |
Correct |
14 ms |
3292 KB |
Output is correct |
21 |
Correct |
17 ms |
3292 KB |
Output is correct |
22 |
Correct |
17 ms |
3292 KB |
Output is correct |
23 |
Correct |
18 ms |
3212 KB |
Output is correct |
24 |
Correct |
17 ms |
3288 KB |
Output is correct |