제출 #1343058

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

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

    int N, K;
    cin >> N >> K;

    vector<long long> T(N);
    for (int i = 0; i < N; i++) cin >> T[i];

    vector<long long> gaps;
    for (int i = 0; i < N - 1; i++) {
        gaps.push_back(T[i + 1] - T[i] - 1);
    }

    sort(gaps.begin(), gaps.end());

    long long ans = N;

    for (int i = 0; i < min((int)gaps.size(), K - 1); i++) {
        ans += gaps[i];
    }

    cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...