//In the name of Allah
//Ya Ali!
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
const ll maxn = 1000 * 1000 ;
const ll INF = 1e18 ;
#define f first
#define s second
ll n , k , a[maxn] ;
vector<ll> v ;
int main()
{
std::ios::sync_with_stdio(0) ;
cin.tie(0) ;
cout.tie(0) ;
cin >> n >> k ;
for(int i = 1 ; i <= n ; i ++){
cin >> a[i] ;
if(i > 1)v.push_back(a[i]-a[i-1]-1) ;
}
sort(v.begin( ) , v.end()) ;
ll sum = n ;
for(int i = 0 ; i < n-k ; i ++){
sum += v[i] ;
}
cout << sum ;
return 0;
}
/*
_ _ __
/_\ (_ (_) __)
/ \ _) . (_) (__
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
348 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
380 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
348 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
380 KB |
Output is correct |
10 |
Correct |
3 ms |
504 KB |
Output is correct |
11 |
Correct |
3 ms |
504 KB |
Output is correct |
12 |
Correct |
3 ms |
504 KB |
Output is correct |
13 |
Correct |
3 ms |
504 KB |
Output is correct |
14 |
Correct |
3 ms |
504 KB |
Output is correct |
15 |
Correct |
3 ms |
380 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
348 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
380 KB |
Output is correct |
10 |
Correct |
3 ms |
504 KB |
Output is correct |
11 |
Correct |
3 ms |
504 KB |
Output is correct |
12 |
Correct |
3 ms |
504 KB |
Output is correct |
13 |
Correct |
3 ms |
504 KB |
Output is correct |
14 |
Correct |
3 ms |
504 KB |
Output is correct |
15 |
Correct |
3 ms |
380 KB |
Output is correct |
16 |
Correct |
26 ms |
3056 KB |
Output is correct |
17 |
Correct |
27 ms |
3028 KB |
Output is correct |
18 |
Correct |
26 ms |
3056 KB |
Output is correct |
19 |
Correct |
27 ms |
3056 KB |
Output is correct |
20 |
Correct |
26 ms |
3052 KB |
Output is correct |
21 |
Correct |
26 ms |
3052 KB |
Output is correct |
22 |
Correct |
27 ms |
3060 KB |
Output is correct |
23 |
Correct |
26 ms |
3056 KB |
Output is correct |
24 |
Correct |
26 ms |
3056 KB |
Output is correct |