제출 #958035

#제출 시각아이디문제언어결과실행 시간메모리
958035MuntherCarrotStove (JOI18_stove)C++17
100 / 100
14 ms2200 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define all(x) x.begin(), x.end()

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, k;
    cin >> n >> k;
    int a[n];
    for(int &i : a){
        cin >> i;
    }
    int b[n - 1] = {};
    for(int i = 0; i < n - 1; i++){
        b[i] = a[i + 1] - a[i] - 1;
    }
    sort(b, b + n - 1);
    cout << n + accumulate(b, b + n - k, 0ll) << endl;
    return 0;
}
// by me
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...