#include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
i64 N, K;
cin >> N >> K;
vector<i64> bet(N - 1);
vector<i64> guests(N);
for (i64 i = 0; i < N; i++)
{
cin >> guests[i];
if (i > 0)
{
bet[i - 1] = guests[i] - guests[i - 1] - 1;
}
}
sort(bet.rbegin(), bet.rend());
i64 wynik = guests[N - 1] - guests[0] + 1;
for (i64 i = 1; i < K; i++)
{
wynik -= bet[i - 1];
}
cout << wynik << "\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
1 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
1 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
10 |
Correct |
2 ms |
336 KB |
Output is correct |
11 |
Correct |
1 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
336 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
1 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
1 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
10 |
Correct |
2 ms |
336 KB |
Output is correct |
11 |
Correct |
1 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
336 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
1 ms |
336 KB |
Output is correct |
16 |
Correct |
15 ms |
1872 KB |
Output is correct |
17 |
Correct |
14 ms |
1872 KB |
Output is correct |
18 |
Correct |
15 ms |
1872 KB |
Output is correct |
19 |
Correct |
18 ms |
1872 KB |
Output is correct |
20 |
Correct |
14 ms |
2040 KB |
Output is correct |
21 |
Correct |
14 ms |
1872 KB |
Output is correct |
22 |
Correct |
14 ms |
2032 KB |
Output is correct |
23 |
Correct |
15 ms |
1872 KB |
Output is correct |
24 |
Correct |
14 ms |
1872 KB |
Output is correct |