Submission #1288387

#TimeUsernameProblemLanguageResultExecution timeMemory
1288387jxngyrStove (JOI18_stove)C++20
100 / 100
40 ms2340 KiB
#include <iostream>
#include<vector>
#include <algorithm>
using namespace std;
int main(){
    long long N,K;
    cin>>N>>K;


    vector<long long> gst(N);


    for(long long i=0;i<N;i++){
        cin>>gst[i];
    }


    // for(long long i=0;i<N;i++){
    //     cout<<gst[i]<<' ';
    // }

    vector<long long> gaps;
    for(long long i=0;i<N-1;i++){
        long long gap=gst[i+1]-gst[i]-1;
        gaps.push_back(gap);
    }

    sort(gaps.begin(), gaps.end());

    long long ans = N;
    for (long long i = 0; i < N - K; i++) {
        ans += gaps[i];
    }
    cout << ans << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...