Submission #1331947

#TimeUsernameProblemLanguageResultExecution timeMemory
1331947bobmathStove (JOI18_stove)C++20
100 / 100
36 ms1044 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N,K;
    cin >> N >> K;
    int A,B,last;
    vector<int> len;
    for(int i = 0; i < N; i++){
        int t; cin >> t;
        if (i==0) A=t;
        if (i==N-1) B=t+1;
        if (0<i) len.push_back(t-last-1);
        last=t;
    }
    sort(len.begin(),len.end(),greater());
    int ans= B - A;
    for (int i=0; i<K-1; i++) ans-=len[i];
    cout<<ans<<'\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...