#include<bits/stdc++.h>
using namespace std;
int main() {
int n,k; cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
priority_queue<int> pq;
for (int i = 0; i < n - 1; i++) {
pq.push(max(0, a[i + 1] - 1 - a[i]));
}
int total = a[n - 1] - a[0] + 1;
while (!pq.empty() && k > 1) {
auto i = pq.top(); pq.pop();
total -= i;
k--;
}
cout << total;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
292 KB |
Output is correct |
| 5 |
Correct |
1 ms |
296 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
292 KB |
Output is correct |
| 5 |
Correct |
1 ms |
296 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
2 ms |
304 KB |
Output is correct |
| 11 |
Correct |
2 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
304 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
292 KB |
Output is correct |
| 5 |
Correct |
1 ms |
296 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
2 ms |
304 KB |
Output is correct |
| 11 |
Correct |
2 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
304 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
332 KB |
Output is correct |
| 16 |
Correct |
47 ms |
2200 KB |
Output is correct |
| 17 |
Correct |
47 ms |
2188 KB |
Output is correct |
| 18 |
Correct |
48 ms |
2184 KB |
Output is correct |
| 19 |
Correct |
49 ms |
2200 KB |
Output is correct |
| 20 |
Correct |
54 ms |
2272 KB |
Output is correct |
| 21 |
Correct |
60 ms |
2188 KB |
Output is correct |
| 22 |
Correct |
59 ms |
2200 KB |
Output is correct |
| 23 |
Correct |
60 ms |
2196 KB |
Output is correct |
| 24 |
Correct |
61 ms |
2200 KB |
Output is correct |
