# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1033588 |
2024-07-25T04:04:23 Z |
BuzzyBeez |
Stove (JOI18_stove) |
C++17 |
|
20 ms |
1504 KB |
#include <bits/stdc++.h>
using namespace std;
int t[100008];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k; cin >> n >> k; --k;
int ans; vector<int> ITs;
for (int i = 1; i <= n; ++i) cin >> t[i];
ans = t[n] - t[1] + 1;
for (int i = 1; i < n; ++i) ITs.push_back(t[i + 1] - t[i] - 1);
sort(ITs.begin(), ITs.end());
while (k && !ITs.empty()) ans -= ITs.back(), ITs.pop_back(), --k;
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 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 |
344 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 |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 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 |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
13 ms |
1504 KB |
Output is correct |
17 |
Correct |
20 ms |
1388 KB |
Output is correct |
18 |
Correct |
13 ms |
1504 KB |
Output is correct |
19 |
Correct |
13 ms |
1504 KB |
Output is correct |
20 |
Correct |
15 ms |
1504 KB |
Output is correct |
21 |
Correct |
13 ms |
1504 KB |
Output is correct |
22 |
Correct |
13 ms |
1504 KB |
Output is correct |
23 |
Correct |
18 ms |
1376 KB |
Output is correct |
24 |
Correct |
16 ms |
1504 KB |
Output is correct |