제출 #959958

#제출 시각아이디문제언어결과실행 시간메모리
959958okkooStove (JOI18_stove)C++17
100 / 100
17 ms2452 KiB
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
    fastIO;
    int n, k;
    cin >> n >> k;
    k--;
    int a[n];
    for(int i=0; i<n; i++) cin >> a[i];
    int ans = a[n-1] - a[0] + 1;
    vector<int> gaps;
    for(int i=1; i<n; i++){
        gaps.push_back(a[i] - a[i-1] - 1);
    }
    sort(gaps.begin(), gaps.end());
    int sz = gaps.size()-1;
    for(int i=sz; k>0 && i>=0; i--, k--){
        ans -= gaps[i];
    }
    cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...