제출 #1092083

#제출 시각아이디문제언어결과실행 시간메모리
1092083vjudge1Stove (JOI18_stove)C++17
0 / 100
1 ms348 KiB
//Stove(Vjudge) #include<bits/stdc++.h> using namespace std; int main(){ int n, k, cnt = 0; cin >> n >> k; k--; int t[n + 10], dist[n + 10]; for(int i = 0; i < n; i++){ cin >> t[i]; } t[0]++; for(int i = 0; i < n - 1; i++){ dist[i] = t[i + 1] - t[i]; t[i + 1]++; //cout << dist[i] << endl; } sort(dist , dist + n); for(int i = n - 2; i >= n - k - 1; i--){ cnt += dist[i]; } sort(t , t + n); //cout << t[n - 1] << endl; cout << t[n - 1] - cnt - 1 << endl; //cout << cnt << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...