# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117634 | wilwxk | Stove (JOI18_stove) | C++14 | 31 ms | 2228 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;
const int MAXN=1e5+5;
priority_queue<int> pq;
int v[MAXN];
int n, x;
int resp;
int main() {
scanf("%d %d", &n, &x);
for(int i=1; i<=n; i++) {
scanf("%d", &v[i]);
if(i!=1) pq.push(v[i]-v[i-1]-1);
}
resp=v[n]-v[1]+1; x--;
while(x--) {
if(pq.size()) {
resp-=pq.top();
pq.pop();
}
}
printf("%d\n", resp);
}
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... |