#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define nl "\n"
#define inf LONG_LONG_MAX
#define show(x); cerr << #x << " is " << x << nl;
#define show2(x,y); cerr << #x << " is " << x << " " << #y << " is " << y << nl;
#define show3(x,y,z); cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << nl;
#define showall(x); cerr << #x << " is "; for (auto i : x) {cerr << i << " ";} cerr << nl;
signed main(){
fastio
int n, k;
cin >> n >> k;
int t[n];
for (int i=0; i<n; i++) cin >> t[i];
sort(t, t+n);
vector<int> gaps;
for (int i=1; i<n; i++) gaps.push_back(t[i]-t[i-1]-1);
sort(gaps.begin(), gaps.end());
int sum = n;
for (int i=0; i<n-k; i++) sum += gaps[i];
cout << sum << nl;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 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 |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 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 |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
17 ms |
3264 KB |
Output is correct |
| 17 |
Correct |
16 ms |
3292 KB |
Output is correct |
| 18 |
Correct |
15 ms |
3348 KB |
Output is correct |
| 19 |
Correct |
16 ms |
3260 KB |
Output is correct |
| 20 |
Correct |
17 ms |
3288 KB |
Output is correct |
| 21 |
Correct |
15 ms |
3288 KB |
Output is correct |
| 22 |
Correct |
15 ms |
3352 KB |
Output is correct |
| 23 |
Correct |
15 ms |
3292 KB |
Output is correct |
| 24 |
Correct |
15 ms |
3292 KB |
Output is correct |
