| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 939982 |
2024-03-07T03:16:42 Z |
alvaro |
Stove (JOI18_stove) |
C++17 |
|
20 ms |
2524 KB |
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
using ll = long long;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define dbg(...)
#endif
void solve() {
int N, K;
cin >> N >> K;
vector<int> T(N);
for (int i = 0; i < N; ++i) { cin >> T[i]; }
int ans = T[N - 1] - T[0] + 1;
priority_queue<int> PQ;
for (int i = 1; i < N; ++i) { PQ.push(T[i] - T[i - 1]); }
while (K-- > 1) {
auto len = PQ.top();
PQ.pop();
ans -= len - 1;
dbg(len, ans);
}
cout << ans << nl;
}
signed main() {
std::ios_base::sync_with_stdio(0), std::cin.tie(0);
solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 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 |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
388 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 |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 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 |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
388 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 |
344 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 |
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 |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 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 |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
388 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 |
344 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 |
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 |
10 ms |
2272 KB |
Output is correct |
| 17 |
Correct |
10 ms |
2384 KB |
Output is correct |
| 18 |
Correct |
10 ms |
2524 KB |
Output is correct |
| 19 |
Correct |
10 ms |
2380 KB |
Output is correct |
| 20 |
Correct |
16 ms |
2272 KB |
Output is correct |
| 21 |
Correct |
20 ms |
2272 KB |
Output is correct |
| 22 |
Correct |
18 ms |
2380 KB |
Output is correct |
| 23 |
Correct |
19 ms |
2272 KB |
Output is correct |
| 24 |
Correct |
19 ms |
2348 KB |
Output is correct |
