| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1212487 | VMaksimoski008 | Stove (JOI18_stove) | C++17 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n, k; cin >> n >> k;
vector<int> a(n+1);
for(int i=1; i<=n; i++) cin >> a[i];
priority_queue<int> pq;
int ans = a[n] - a[1] + 1;
for(int i=1; i<n; i++) pq.push(a[i] - a[i-1] - 1);
for(int i=0; i<k-1; i++) ans -= pq.top(), pq.pop();
cout << ans << '\n';
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
