제출 #1290527

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

int main() {
    int N, K;
    cin >> N >> K;
    
    vector<long long> T(N);
    for(int i = 0; i < N; i++) {
        cin >> T[i];
    }
    long long toplam = T[N-1] + 1 - T[0];
    vector<long long> bosluklar;
    for(int i = 0; i < N-1; i++) {
        long long bosluk = T[i+1] - (T[i] + 1);
        bosluklar.push_back(bosluk);
    }
    sort(bosluklar.begin(), bosluklar.end(), greater<long long>());
    for(int i = 0; i < N-K; i++) {
        toplam -= bosluklar[i];
    }
    
    cout << toplam << endl;
    
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...