제출 #678769

#제출 시각아이디문제언어결과실행 시간메모리
678769speedyArdaStove (JOI18_stove)C++14
100 / 100
89 ms6724 KiB
#include "bits/stdc++.h" using namespace std; using ll = long long; int main() { ll n, k; cin >> n >> k; ll ans = n; multiset<ll> diff; ll in[n]; for(int i = 0; i < n; i++) { cin >> in[i]; if(i > 0) diff.insert(in[i] - in[i - 1] - 1); } int curr = n; while(curr > k) { ll add = *(diff.begin()); ans += add; diff.erase(diff.begin()); curr--; } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...