#include<bits/stdc++.h>
#define ll long long
using namespace std;
void setIO() {
cin.tie(0)->sync_with_stdio(0);
//ios_base::sync_with_stdio(false); cin.tie(0);
}
const int N = 1e6 + 10;
int t;
ll ans;
ll n,m,k;
ll a;
ll res;
int pos;
ll c;
ll b;
int no;
ll sum =0;
int main() {
setIO();
int t;
t=1;
while(t--){
cin >> n >> k;
ll a[n],b[n];
for(int i =0;i<n;++i){
cin >> a[i];
}
ll value = a[n-1]+1- a[0];
for(int i =0;i<n-1;++i){
b[i]= (a[i+1] - (a[i]+1));
}
sort(b,b+(ll)n-1);
for(int i =0;i<k-1;++i){
value -= b[n-2-i];
}
cout << value ;
}
}
# |
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 |
592 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 |
592 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 |
1 ms |
508 KB |
Output is correct |
11 |
Correct |
2 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
504 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 |
592 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 |
1 ms |
508 KB |
Output is correct |
11 |
Correct |
2 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
504 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 |
1860 KB |
Output is correct |
18 |
Correct |
14 ms |
1872 KB |
Output is correct |
19 |
Correct |
14 ms |
2040 KB |
Output is correct |
20 |
Correct |
15 ms |
1872 KB |
Output is correct |
21 |
Correct |
14 ms |
1872 KB |
Output is correct |
22 |
Correct |
15 ms |
1872 KB |
Output is correct |
23 |
Correct |
14 ms |
2024 KB |
Output is correct |
24 |
Correct |
15 ms |
1872 KB |
Output is correct |