| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1279375 | peanut | Stove (JOI18_stove) | C++20 | 16 ms | 1024 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
int n, k; cin >> n >> k;
int prev; cin >> prev;
int ans = -prev;
vector<int> gaps;
for (int i = 1; i < n; ++i)
{
int cur; cin >> cur;
gaps.push_back(cur - (prev + 1));
prev = cur;
}
sort(gaps.rbegin(), gaps.rend());
ans += prev + 1;
for (int i = 0; i < k-1; ++i) ans -= gaps[i];
cout << ans;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
