#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin>>n>>k;
int a[n+1];
for(int i=1;i<=n;i++)cin>>a[i];
int A[n+1];
for(int i=0;i<=n;i++)A[i]=0;
A[n]=1;
int ans=0;
ans+=a[n]+1-a[1];
k--;
/*
while(k--){
vector<pair<int,int>>v;
int suf[n+1];
suf[n]=n;
for(int i=n-1;i>=1;i--){
if(A[i])suf[i]=i;
else suf[i]=suf[i+1];
}
int pret=1;
for(int i=1;i<=n;i++){
if(A[i]){
pret=i;
continue;
}
int R=ans;
int sl=suf[i];
//R+=-(a[sl]+1-a[pret+1])+a[sl]+1-a[i+1]+a[i]+1-a[pret+1];
R+=a[i]-a[i+1]+1;
//R-=a[sl]+1-a[pret+1];
//R+=a[sl]+1-a[i+1];
//R+=a[i]+1-a[pret+1];
v.push_back({R,i});
}
sort(v.begin(),v.end());
int b=v[0].second;
A[b]=1;
int sl=-1;
for(int i=b+1;i<=n;i++){
if(A[i]){
sl=i;
break;
}
}
pret=1;
for(int i=1;i<b;i++){
if(A[i]){
pret=i;
}
}
//ans-=a[sl]+1-a[pret+1];
//ans+=a[sl]+1-a[b+1];
//ans+=a[b]+1-a[pret+1];
//ans+=-(a[sl]+1-a[pret+1])+a[sl]+1-a[b+1]+a[b]+1-a[pret+1];
ans+=-a[b+1]+a[b]+1;
}*/
vector<int>V;
for(int i=1;i<n;i++){
V.push_back(a[i]-a[i+1]+1);
}
sort(V.begin(),V.end());
for(int i=0;i<k;i++)ans+=V[i];
cout<<ans;
}
/*
a[i]+1-a[pret];
pret=i+1;
*/
Compilation message
stove.cpp: In function 'int main()':
stove.cpp:11:9: warning: variable 'A' set but not used [-Wunused-but-set-variable]
11 | int A[n+1];
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
424 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 |
0 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
424 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 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 |
0 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
424 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 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 |
15 ms |
3804 KB |
Output is correct |
17 |
Correct |
15 ms |
3804 KB |
Output is correct |
18 |
Correct |
15 ms |
3708 KB |
Output is correct |
19 |
Correct |
16 ms |
4060 KB |
Output is correct |
20 |
Correct |
16 ms |
4060 KB |
Output is correct |
21 |
Correct |
15 ms |
4060 KB |
Output is correct |
22 |
Correct |
15 ms |
4060 KB |
Output is correct |
23 |
Correct |
18 ms |
4060 KB |
Output is correct |
24 |
Correct |
15 ms |
4056 KB |
Output is correct |