#include <iostream>
#include <algorithm>
using namespace std;
long long ans ;
int main()
{
long long n,k;
cin>>n>>k;
ans = n;
long long a[n];
long long pr[n-1];
long long pok = k;
for(long long i = 0 ;i<n; i++){
cin>>a[i];
}
for(long long i = 0; i<n-1; i++){
pr[i]=a[i+1]-a[i]-1;
}
sort(pr,pr+n-1);
for(int i = 0 ; i<n-1;i++){
if(pr[i]==0){
pok++;
pr[i]=1000000001;
if(pok>=n){
break;
}
}
else{
break;
}
}
if(pok<n){
sort(pr,pr+n-1);
for(int i = 0 ; i<n-pok; i++){
ans+=pr[i];
}
cout<<ans;
}
else{
cout<<ans;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 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 |
0 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 |
344 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 |
0 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 |
2 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 |
344 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 |
0 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 |
2 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 |
30 ms |
1884 KB |
Output is correct |
17 |
Correct |
30 ms |
1884 KB |
Output is correct |
18 |
Correct |
36 ms |
1880 KB |
Output is correct |
19 |
Correct |
29 ms |
1884 KB |
Output is correct |
20 |
Correct |
30 ms |
1884 KB |
Output is correct |
21 |
Correct |
30 ms |
1884 KB |
Output is correct |
22 |
Correct |
29 ms |
1996 KB |
Output is correct |
23 |
Correct |
29 ms |
1992 KB |
Output is correct |
24 |
Correct |
29 ms |
1884 KB |
Output is correct |