# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125588 | phoop | Stove (JOI18_stove) | C++20 | 21 ms | 1032 KiB |
#include <bits/stdc++.h>
using namespace std;
priority_queue<int> pq;
int main()
{
int N,K,past,now; scanf("%d %d %d",&N,&K,&now);
for(int i=1;i<N;i++)
{
past=now;
scanf("%d",&now);
pq.push(-(now-past-1));
}
int ans=N;
for(int 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... |