제출 #1290530

#제출 시각아이디문제언어결과실행 시간메모리
1290530burak_bulutStove (JOI18_stove)C++20
100 / 100
14 ms1488 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n, k;
    cin >> n >> k;
    
    vector<int> t(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    
    vector<int> gaps;
    for (int i = 0; i < n - 1; i++) {
        gaps.push_back(t[i + 1] - t[i] - 1);
    }
    
    sort(gaps.rbegin(), gaps.rend());
    
    int total = t[n - 1] - t[0] + 1;
    
    for (int i = 0; i < min(k - 1, (int)gaps.size()); i++) {
        total -= gaps[i];
    }
    
    cout << total << endl;
    
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...