# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331761 | daniel920712 | Stove (JOI18_stove) | C++14 | 28 ms | 2152 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
using namespace std;
vector < int > all;
int when[100005]={0};
int main()
{
int N,M,ans=0,i;
scanf("%d %d",&N,&M);
ans=N;
for(i=0;i<N;i++)
{
scanf("%d",&when[i]);
if(i) all.push_back(when[i]-when[i-1]-1);
}
sort(all.begin(),all.end());
for(i=0;i<N-M;i++) ans+=all[i];
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... |