제출 #1257653

#제출 시각아이디문제언어결과실행 시간메모리
1257653damasenStove (JOI18_stove)C++20
100 / 100
29 ms1864 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n, k; cin >> n >> k; vector<long long> guests (n); for(int i = 0; i < n; i++){ cin >> guests[i]; } vector<long long> gaps(n-1); for(int i = 0; i < n-1; i++){ gaps[i] = guests[i+1]-(guests[i]+1); } sort(gaps.rbegin(), gaps.rend()); long long ans = n; for(int i = k-1; i < n-1 && gaps[i] > 0; i++){ ans += gaps[i]; } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...