| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 885421 |
2023-12-09T16:24:55 Z |
raspy |
Stove (JOI18_stove) |
C++14 |
|
42 ms |
3048 KB |
#include <iostream>
#include <queue>
#include <vector>
#define int long long
using namespace std;
int a[200005];
int32_t main()
{
int n, k;
cin >> n >> k;
priority_queue<int, vector<int>, greater<int>> pq;
int tr = 1;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (i && a[i] != a[i-1]+1)
{
tr++;
pq.push(a[i]-a[i-1]-1);
}
}
int rez = n;
while (tr > k)
{
rez += pq.top();
pq.pop();
tr--;
}
cout << rez << "\n";
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 |
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 |
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 |
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 |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
2 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 |
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 |
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 |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
2 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 |
42 ms |
3016 KB |
Output is correct |
| 17 |
Correct |
40 ms |
3016 KB |
Output is correct |
| 18 |
Correct |
39 ms |
3024 KB |
Output is correct |
| 19 |
Correct |
38 ms |
3016 KB |
Output is correct |
| 20 |
Correct |
34 ms |
3012 KB |
Output is correct |
| 21 |
Correct |
31 ms |
3048 KB |
Output is correct |
| 22 |
Correct |
29 ms |
3016 KB |
Output is correct |
| 23 |
Correct |
32 ms |
3016 KB |
Output is correct |
| 24 |
Correct |
29 ms |
2980 KB |
Output is correct |
