| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1338309 | m0use | Stove (JOI18_stove) | C++20 | 19 ms | 1480 KiB |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> visit(n);
for(int i = 0; i < n; i++) cin >> visit[i];
sort(visit.begin(), visit.end());
priority_queue<int> pq;
for(int i = 1; i < n; i++) pq.push(visit[i]-visit[i-1]-1);
for(int i = 1; i < k; i++) pq.pop();
ll ans = n;
while(pq.size()) {
ans += pq.top();
pq.pop();
}
cout << ans << '\n';
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... | ||||
