#include <bits/stdc++.h>
int main(void) {
std::ios_base::sync_with_stdio(0);
std::cin.tie(nullptr);
int n, k; std::cin >> n >> k;
std::vector <int> a(n);
std::vector <int> b; b.reserve(n - 1);
k = std::min(k - 1, n);
for (int i = 0; i < n; i += 1) {
std::cin >> a[i];
if (i)
b.push_back(a[i] - a[i - 1] - 1);
}
int ans = a[n - 1] - a[0] + 1;
std::sort(b.begin(), b.end(), std::greater <> ());
std::cout << ans - std::accumulate(b.begin(), b.begin() + k, 0) << '\n';
return 0^0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
548 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
600 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
548 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
600 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
516 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
2 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
600 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
548 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
600 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
516 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
2 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
600 KB |
Output is correct |
16 |
Correct |
14 ms |
2136 KB |
Output is correct |
17 |
Correct |
14 ms |
2136 KB |
Output is correct |
18 |
Correct |
14 ms |
2392 KB |
Output is correct |
19 |
Correct |
14 ms |
2136 KB |
Output is correct |
20 |
Correct |
15 ms |
2136 KB |
Output is correct |
21 |
Correct |
14 ms |
2136 KB |
Output is correct |
22 |
Correct |
14 ms |
2140 KB |
Output is correct |
23 |
Correct |
14 ms |
2140 KB |
Output is correct |
24 |
Correct |
14 ms |
2136 KB |
Output is correct |