# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171701 | dennisstar | Stove (JOI18_stove) | C++11 | 33 ms | 2480 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;
int n, k, t[100010];
priority_queue<int, vector<int>, greater<int> > pq;
int main() {
scanf("%d %d", &n, &k);
int ans=n, i;
for (i=0; i<n; i++) scanf("%d", &t[i]);
for (i=0; i<n-1; i++) pq.push(t[i+1]-t[i]-1);
for (i=0; i<n-k; i++) { ans+=pq.top(); pq.pop(); }
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |