| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 349572 |
2021-01-17T21:02:39 Z |
Farrius |
Stove (JOI18_stove) |
C++11 |
|
59 ms |
2408 KB |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n, k;
cin >> n >> k;
int ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
sort(ar, ar + n);
priority_queue<int> segments;
int sol = n;
for (int i = 1; i < n; i++) {
int cur = ar[i] - ar[i - 1] - 1;
segments.push(cur);
sol += cur;
}
k--;
while (k-- && !segments.empty()) {
sol -= segments.top();
segments.pop();
}
cout << sol << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
2 ms |
384 KB |
Output is correct |
| 11 |
Correct |
2 ms |
364 KB |
Output is correct |
| 12 |
Correct |
2 ms |
364 KB |
Output is correct |
| 13 |
Correct |
3 ms |
364 KB |
Output is correct |
| 14 |
Correct |
2 ms |
364 KB |
Output is correct |
| 15 |
Correct |
2 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
2 ms |
384 KB |
Output is correct |
| 11 |
Correct |
2 ms |
364 KB |
Output is correct |
| 12 |
Correct |
2 ms |
364 KB |
Output is correct |
| 13 |
Correct |
3 ms |
364 KB |
Output is correct |
| 14 |
Correct |
2 ms |
364 KB |
Output is correct |
| 15 |
Correct |
2 ms |
364 KB |
Output is correct |
| 16 |
Correct |
46 ms |
2348 KB |
Output is correct |
| 17 |
Correct |
48 ms |
2408 KB |
Output is correct |
| 18 |
Correct |
46 ms |
2280 KB |
Output is correct |
| 19 |
Correct |
47 ms |
2280 KB |
Output is correct |
| 20 |
Correct |
52 ms |
2280 KB |
Output is correct |
| 21 |
Correct |
57 ms |
2408 KB |
Output is correct |
| 22 |
Correct |
58 ms |
2280 KB |
Output is correct |
| 23 |
Correct |
59 ms |
2408 KB |
Output is correct |
| 24 |
Correct |
58 ms |
2300 KB |
Output is correct |
