| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 542722 |
2022-03-27T17:06:16 Z |
collodel |
Stove (JOI18_stove) |
C++17 |
|
50 ms |
2252 KB |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, k; cin >> n >> k;
vector<int> t(n);
for(auto &x : t) {
cin >> x;
}
priority_queue<int> pq;
for(int i = 1; i < n; ++i)
pq.emplace(t[i] - t[i-1] - 1);
int ans = t[n-1] - t[0] + 1;
k--;
while(k--) {
ans -= pq.top(), pq.pop();
}
cout << ans << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
296 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
296 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
2 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
312 KB |
Output is correct |
| 12 |
Correct |
2 ms |
340 KB |
Output is correct |
| 13 |
Correct |
2 ms |
316 KB |
Output is correct |
| 14 |
Correct |
2 ms |
340 KB |
Output is correct |
| 15 |
Correct |
2 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
296 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
2 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
312 KB |
Output is correct |
| 12 |
Correct |
2 ms |
340 KB |
Output is correct |
| 13 |
Correct |
2 ms |
316 KB |
Output is correct |
| 14 |
Correct |
2 ms |
340 KB |
Output is correct |
| 15 |
Correct |
2 ms |
340 KB |
Output is correct |
| 16 |
Correct |
43 ms |
2192 KB |
Output is correct |
| 17 |
Correct |
40 ms |
2196 KB |
Output is correct |
| 18 |
Correct |
40 ms |
2212 KB |
Output is correct |
| 19 |
Correct |
40 ms |
2252 KB |
Output is correct |
| 20 |
Correct |
47 ms |
2192 KB |
Output is correct |
| 21 |
Correct |
50 ms |
2208 KB |
Output is correct |
| 22 |
Correct |
49 ms |
2208 KB |
Output is correct |
| 23 |
Correct |
49 ms |
2216 KB |
Output is correct |
| 24 |
Correct |
50 ms |
2204 KB |
Output is correct |
