# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
539692 | krit3379 | Stove (JOI18_stove) | C++17 | 38 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;
#define N 100005
int t[N];
priority_queue<int> q;
int main(){
int n,k,i,ans;
scanf("%d %d",&n,&k);
ans=n;
for(i=1;i<=n;i++){
scanf("%d",&t[i]);
if(i>1)q.push(t[i]-t[i-1]-1);
}
while(!q.empty()&&--k)q.pop();
while(!q.empty())ans+=q.top(),q.pop();
printf("%d",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... |