Submission #1191799

#TimeUsernameProblemLanguageResultExecution timeMemory
1191799takoStove (JOI18_stove)C++20
50 / 100
30 ms1216 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
const int N=1e5;
int n, k, t[N];
int s, ans;
vector <int> v;

bool f[N];

int main() {
	cin>>n>>k;

    for (int i=1; i<=n; i++){
        cin>>t[i];
        if (i!=1) v.push_back(t[i]-t[i-1]-1);

    }

    sort(v.begin(), v.end());
    reverse (v.begin(), v.end());

    for (int i=0; i<k-1; i++) {
        s+=v[i];
    }

    ans=t[n]-t[1]-s+1;

    cout<<ans<<endl;

}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...