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>
long long a[150005], ans;
int main(){
	int n; long long L;
	scanf("%d %lld", &n, &L);
	for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
	std::sort(a, a + n);
	long long x = a[0] + L, s = a[0] - L;
	for (int i = 1; i < n; i++){
		if(a[i] - L > s) s = a[i] - L;
		if (s <= x){
			ans += (x - s);
			s = x;
		}
		x = a[i] + L;
	}
	printf("%lld", ans);
	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... |