Submission #1251633

#TimeUsernameProblemLanguageResultExecution timeMemory
1251633phamminhsonStove (JOI18_stove)C++20
100 / 100
33 ms1988 KiB
#include<bits/stdc++.h>
using namespace std;

int n,k;

long long int res=1;
long long int a[100005];
vector<long long int>dist;

int main(){
    cin>>n>>k;
    cin>>a[1];
    for(int i=2;i<=n;i++){
        cin>>a[i];
        dist.push_back(a[i]-a[i-1]-1);
        res+=a[i]-a[i-1];
    }
    sort(dist.begin(),dist.end(),greater<long long int>());

    for(int i=0;i<k-1;i++){
        res-=dist[i];
    }
    cout<<res<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...