#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, k, a;
cin >> n >> k;
vector<ll> czasy;
for (int i=0; i<n; i++){
cin >> a;
czasy.push_back(a);
}
sort(czasy.begin(), czasy.end());
vector<ll> przerwy;
ll poprzedni=czasy[0];
for (int i=1; i<(int)czasy.size(); i++){
//cout << i << " " << czasy[i] << endl;
przerwy.push_back(czasy[i]-poprzedni-1);
poprzedni = czasy[i];
}
sort(przerwy.begin(), przerwy.end());
ll wyn=0;
for (int i=0; i<n-k; i++){
//cout << i << " prz" << przerwy[i] << endl;
wyn+=przerwy[i];
}
cout << wyn+n << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
504 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
504 KB |
Output is correct |
10 |
Correct |
1 ms |
504 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 |
548 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
1 ms |
504 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
504 KB |
Output is correct |
10 |
Correct |
1 ms |
504 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 |
548 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
1 ms |
504 KB |
Output is correct |
16 |
Correct |
16 ms |
2764 KB |
Output is correct |
17 |
Correct |
16 ms |
2764 KB |
Output is correct |
18 |
Correct |
16 ms |
2764 KB |
Output is correct |
19 |
Correct |
16 ms |
2764 KB |
Output is correct |
20 |
Correct |
16 ms |
2932 KB |
Output is correct |
21 |
Correct |
17 ms |
2764 KB |
Output is correct |
22 |
Correct |
17 ms |
2764 KB |
Output is correct |
23 |
Correct |
19 ms |
2536 KB |
Output is correct |
24 |
Correct |
17 ms |
2764 KB |
Output is correct |