Submission #1014193

#TimeUsernameProblemLanguageResultExecution timeMemory
1014193snpmrnhlolStove (JOI18_stove)C++17
100 / 100
50 ms2140 KiB
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5;
int v[N];
int v2[N];
int main(){
    int n,k;
    int ans;
    cin>>n>>k;
    ans = n;
    for(int i = 0;i < n;i++){
        cin>>v[i];
        if(i){
            v2[i - 1] = v[i] - v[i - 1] - 1;
        }
    }
    sort(v2,v2 + n - 1);
    for(int i = 0;i < n - k;i++){
        ans+=v2[i];
    }
    cout<<ans<<'\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...