#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(ll i =0;i<n;++i){
cin >> a[i];
}
for(ll i =1;i<n-1;++i){
b[i]= a[i]++ - a[i-1];
}
sort(b,b+n);
sort(a,a+n);
for(ll i =1;i<k;++i){
sum += b[i];
}
cout << a[n-1]-sum;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |