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 <algorithm>
using namespace std;
int n,l;
long long sum;
long long slight[300000],elight[300000];
int main()
{
scanf("%d %d",&n, &l);
int i;
for(i = 1 ; i <= n ; i++){
scanf("%d",&slight[i]);
slight[i]-=l;
}
sort(slight+1,slight+1+n);
for(i = 1 ; i <= n ; i++){
elight[i]=slight[i]+l*2;
}
int s=slight[1],x=elight[1];
for(i = 2 ; i <= n ; i++){
if(s<slight[i])s=slight[i];
if(s<=x){
sum+=x-s;
s=x;
}
x=elight[i];
}
printf("%lld",sum);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |