| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 978260 |
2024-05-09T05:00:13 Z |
YABYAB |
Stove (JOI18_stove) |
C++17 |
|
46 ms |
2516 KB |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
int ll[n];
for(int i = 0; i < n; i++){
cin >> ll[i];
}
priority_queue<int> pq;
for(int i = 0; i < n-1; i++){
pq.push(ll[i+1]-ll[i]-1);
}
k--;
int ans = ll[n-1] - ll[0] +1;
while(k>0 && !pq.empty() && pq.top() > 0){
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 |
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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 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 |
344 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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 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 |
344 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 |
29 ms |
2252 KB |
Output is correct |
| 17 |
Correct |
30 ms |
2256 KB |
Output is correct |
| 18 |
Correct |
29 ms |
2264 KB |
Output is correct |
| 19 |
Correct |
31 ms |
2516 KB |
Output is correct |
| 20 |
Correct |
34 ms |
2324 KB |
Output is correct |
| 21 |
Correct |
37 ms |
2448 KB |
Output is correct |
| 22 |
Correct |
39 ms |
2264 KB |
Output is correct |
| 23 |
Correct |
38 ms |
2328 KB |
Output is correct |
| 24 |
Correct |
46 ms |
2324 KB |
Output is correct |
