제출 #607359

#제출 시각아이디문제언어결과실행 시간메모리
607359tvladmStove (JOI18_stove)C++14
100 / 100
53 ms1732 KiB
#include <iostream>
#include <algorithm>

using namespace std;

const int MAX_N = 1e5;
int a[MAX_N + 1];
int n, k;

int main() {
    int ant;
    cin >> n >> k >> ant;
    for (int i = 2; i <= n; i++) {
        int x;
        cin >> x;
        a[i - 1] = x - ant - 1;
        ant = x;
    }
    sort(a + 1, a + n);
    int answer = 0;
    for (int i = 1; i <= n - k; i++) {
        answer += a[i];
    }
    cout << answer + n;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...