Submission #541671

#TimeUsernameProblemLanguageResultExecution timeMemory
541671AngusWongStove (JOI18_stove)C++17
100 / 100
53 ms1280 KiB
#include <bits/stdc++.h>
#define pii pair<int, int>
#define f first
#define s second
using namespace std;

int n, k, a[100001], ans;
vector<int> v;

int main(){
    cin >> n >> k;
    for (int i=1; i<=n; i++){
        cin >> a[i];
        if (i>1) v.push_back(a[i]-a[i-1]-1);
    }
    sort(v.begin(), v.end());
    ans=n;
    for (int i=0; i<n-k; i++) ans+=v[i];
    cout << ans << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...