제출 #1091611

#제출 시각아이디문제언어결과실행 시간메모리
1091611anmattroiStove (JOI18_stove)C++14
100 / 100
19 ms2208 KiB
#include <bits/stdc++.h>

using namespace std;

int t[100001];
int a[100001];
int n, k, m = 0;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> t[i];
    for (int i = 1; i < n; i++) a[++m] = (t[i+1] - (t[i]+1));
    int s = t[n]+1 - t[1];
    sort(a + 1, a + m + 1);
    reverse(a + 1, a + m + 1);
    for (int i = 1; i < k; i++) s -= a[i];
    cout << s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...