Submission #81937

#TimeUsernameProblemLanguageResultExecution timeMemory
81937mra2322001Stove (JOI18_stove)C++14
100 / 100
29 ms10240 KiB
#include <bits/stdc++.h>
#define f0(i, n) for(int i(0); i < (n); i++)
#define f1(i, n) for(int i(1); i <= n; i++)

using namespace std;
typedef long long ll;
const int N = 100002;

int n, a[N], b[N], k;

int main(){
    ios_base::sync_with_stdio(0);

    cin >> n >> k;
    f1(i, n) cin >> a[i];

    if(k==n){
        cout << n; return 0;
    }
    f1(i, n - 1){
        b[i] = a[i + 1] - a[i] - 1;
    }
    int res = a[n] - a[1] + 1;
    sort(b + 1, b + n + 1);
    for(int i = n; i >= n - k + 2; i--){
        res = res - b[i];
    }
    cout << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...