| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1333561 | justin271828 | Stove (JOI18_stove) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int T[N];
for (int i = 0; i < N; i++) cin >> T[i];
int ans = T[N-1]-T[0]+1;
priority_queue<int> pq;
for (int i = 1; i < N; i++) pq.push(T[i]-T[i-1]-1);
while (K-- > 0) {
ans -= pq.top();
pq.pop();
}
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... | ||||
