제출 #1156042

#제출 시각아이디문제언어결과실행 시간메모리
1156042aritro_Stove (JOI18_stove)C++20
0 / 100
0 ms324 KiB
#include<bits/stdc++.h>
using namespace std;

typedef long long int ll;
#define int ll
#define pb push_back
#define all(a) a.begin(),a.end()

void solve(){
    int n,k;
    cin>>n>>k;
    int a[n];
    for(int i=0;i<n;i++) cin>>a[i];
    int dif[n-1]={0};
    for(int i=1;i<n;i++){
        dif[i-1]=abs(a[i-1]-a[i]);
    }
    int ans=a[n-1]-a[0]+1;
    sort(dif,dif+n,greater<>());
    int i=0;
    k--;
    while(k--){
        ans-=dif[i]-1;
        i++;
    }
    cout<<ans<<endl;
}

int32_t main(){
    solve();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...