# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564062 | Trisanu_Das | Stove (JOI18_stove) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
// difficulty: cakewalk if u know there is a thing called priority queue
int main(){
int n, k; cin >> n >> k;
priority_queue<int, vector<int>, greater<int> > times;
int arr[n];
int ans = n;
for(int i = 0; i < n; i++){
cin >> arr[i];
if(i > 0) times.push(a[i] - a[i - 1] - 1);
}
k = n - k;
while(k > 0 && !times.empty()){
ans += times.top(); times.pop(); k--;
}
cout << ans << '\n';
}