# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51937 | TadijaSebez | Stove (JOI18_stove) | C++11 | 37 ms | 10652 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 <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
const int N=100050;
int t[N];
int main()
{
int n,k,i;
scanf("%i %i",&n,&k);
for(i=1;i<=n;i++) scanf("%i",&t[i]);
sort(t+1,t+1+n);
vector<int> del;
for(i=2;i<=n;i++)
{
del.push_back(t[i]-t[i-1]-1);
}
sort(del.rbegin(),del.rend());
int sol=t[n]-t[1]+1;
for(i=0;i<k-1;i++)
{
sol-=del[i];
}
printf("%i\n",sol);
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... |