#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(true);
long long n;
long long k;
cin>>n>>k;
long long x[n+1];
long long mx=0;
long long mi=1e18;
for(long long i=1;i<=n;i++)
{
cin>>x[i];
mx=max(mx,x[i]);
mi=min(mi,x[i]);
}
long long a[n+1]={0};
for(long long i=1;i<n;i++)
{
a[i]=x[i+1]-x[i]-1;
}
sort(a,a+n);
reverse(a,a+n);
long long ans=mx-mi+1;
for(long long i=1;i<k;i++)
{
ans-=a[i];
}
cout<<ans<<endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |