| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 889364 |
2023-12-19T13:41:48 Z |
Hugo1729 |
Stove (JOI18_stove) |
C++11 |
|
43 ms |
2532 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,k; cin >> n >> k;
ll ans=n;
priority_queue<ll,vector<ll>,greater<ll>> p;
int last; cin >> last;
for(int i=1;i<n;i++) {
int t; cin >> t;
p.push(t-last-1);
last=t;
}
int sus=n-k;
while(sus--){
ans+= p.top();
p.pop();
}
cout << ans;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 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 |
432 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 |
348 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 |
432 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 |
344 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 |
348 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 |
432 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 |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
38 ms |
2216 KB |
Output is correct |
| 17 |
Correct |
38 ms |
2256 KB |
Output is correct |
| 18 |
Correct |
40 ms |
2532 KB |
Output is correct |
| 19 |
Correct |
37 ms |
2248 KB |
Output is correct |
| 20 |
Correct |
34 ms |
2260 KB |
Output is correct |
| 21 |
Correct |
43 ms |
2260 KB |
Output is correct |
| 22 |
Correct |
29 ms |
2256 KB |
Output is correct |
| 23 |
Correct |
29 ms |
2368 KB |
Output is correct |
| 24 |
Correct |
29 ms |
2424 KB |
Output is correct |
