제출 #1333562

#제출 시각아이디문제언어결과실행 시간메모리
1333562ensonStove (JOI18_stove)C++20
100 / 100
27 ms2364 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int N, K;
    cin >> N >> K;
    int T[N];
    for(int i = 0; i < N; i++){
        cin >> T[i];
    }
    priority_queue<int>pq;
    for(int i = 0; i < N-1; i++){
        pq.push(T[i+1]-T[i]-1);
    }
    for(int i = 0; i < K-1; i++){
        pq.pop();
    }
    int a = N;
    while(!pq.empty()){
        a += pq.top();
        pq.pop();
    }
    cout << a;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...