Submission #1290474

#TimeUsernameProblemLanguageResultExecution timeMemory
1290474topraksennStove (JOI18_stove)C++20
100 / 100
39 ms1972 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main(){
    int n,k;
    cin>>n>>k;
    vector<int>a(n);
    for(int i=0;i<n;i++) cin>>a[i];
    if(n==k){
        cout<<n;
        return 0;
    }
    vector<int>b(n-1);
    for(int i=1;i<n;i++){
        b[i-1]=a[i]-a[i-1]-1;
    }
    sort(b.begin(),b.end());
    int sonuc=a[n-1]-a[0]+1;
    int c=0;
    for(int i=n-k;i<n-1;i++){
        c+=b[i];
    }
    sonuc-=c;
    cout<<sonuc;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...