# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1034571 |
2024-07-25T15:03:06 Z |
sunboi |
Stove (JOI18_stove) |
C++17 |
|
43 ms |
3284 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int n, k; cin >> n >> k;
vector<int> a(n);
vector<int> gaps;
for (int i = 0; i < n; i++){
cin >> a[i];
}
int ans = a[n - 1] + 1 - a[0];
for (int i = 1; i < n; i++){
gaps.push_back(a[i] - (a[i - 1] + 1));
}
sort(gaps.begin(), gaps.end());
reverse(gaps.begin(), gaps.end());
for (int i = 0; i < k - 1; i++){
ans -= gaps[i];
}
cout << ans << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
1 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 |
1 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 |
1 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 |
2 ms |
348 KB |
Output is correct |
12 |
Correct |
2 ms |
488 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
484 KB |
Output is correct |
15 |
Correct |
1 ms |
484 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
1 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 |
2 ms |
348 KB |
Output is correct |
12 |
Correct |
2 ms |
488 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
484 KB |
Output is correct |
15 |
Correct |
1 ms |
484 KB |
Output is correct |
16 |
Correct |
40 ms |
3280 KB |
Output is correct |
17 |
Correct |
43 ms |
3276 KB |
Output is correct |
18 |
Correct |
31 ms |
3276 KB |
Output is correct |
19 |
Correct |
30 ms |
3248 KB |
Output is correct |
20 |
Correct |
31 ms |
3276 KB |
Output is correct |
21 |
Correct |
33 ms |
3284 KB |
Output is correct |
22 |
Correct |
31 ms |
3244 KB |
Output is correct |
23 |
Correct |
30 ms |
3112 KB |
Output is correct |
24 |
Correct |
31 ms |
3284 KB |
Output is correct |