#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n,k;cin>>n>>k;
vector<int64_t>arr(n);
for (int i =0;i<n;++i){
cin>>arr[i];
}
vector<int64_t>brr;
for (int i =0;i<n-1;++i){
brr.push_back(arr[i+1]-arr[i]-1);
}
sort(brr.rbegin(),brr.rend());
int64_t ans = arr[n-1]+1-arr[0];
for (int i =0;i<k-1;++i)ans-=brr[i];
cout<<ans<<endl;}
//2 + 4 + 3 + 2 + 1
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
288 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
288 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
288 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
288 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
2 ms |
332 KB |
Output is correct |
| 11 |
Correct |
3 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
3 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
400 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
288 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
288 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
2 ms |
332 KB |
Output is correct |
| 11 |
Correct |
3 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
3 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
400 KB |
Output is correct |
| 16 |
Correct |
57 ms |
3168 KB |
Output is correct |
| 17 |
Correct |
56 ms |
3260 KB |
Output is correct |
| 18 |
Correct |
53 ms |
3104 KB |
Output is correct |
| 19 |
Correct |
54 ms |
3104 KB |
Output is correct |
| 20 |
Correct |
59 ms |
3132 KB |
Output is correct |
| 21 |
Correct |
64 ms |
3088 KB |
Output is correct |
| 22 |
Correct |
61 ms |
3088 KB |
Output is correct |
| 23 |
Correct |
58 ms |
3104 KB |
Output is correct |
| 24 |
Correct |
61 ms |
3096 KB |
Output is correct |
