제출 #915954

#제출 시각아이디문제언어결과실행 시간메모리
915954MatjazStove (JOI18_stove)C++14
100 / 100
34 ms2140 KiB
// // JOI18_STOVE.cpp // // // Created by Matjaz Leonardis on 25/01/2024. // #include <iostream> #include <vector> #include <algorithm> using namespace std; int main(){ int N,K; cin >> N >> K; vector<int> T(N); vector<int> gap(N - 1); for (int i=0;i<N;i++){ cin >> T[i]; if (i > 0) gap[i - 1] = T[i] - T[i-1] - 1; } int time_on = T[N-1] - T[0] + 1; int ngaps = K - 1; sort(gap.rbegin(), gap.rend()); for (int i=0;i<ngaps;i++) time_on -= gap[i]; cout << time_on << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...