709B - Checkpoints - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6+100;
ll n,a,ans=1e18+100;
ll x[N];
int main()
{
	cin>>n>>a;
	for(int i=1;i<=n;i++) cin>>x[i];
	sort(x+1,x+n+1);
	if(n==1){
		cout<<0<<endl;
		return 0;
	}
	if(x[n]<=a) cout<<a-x[2]<<endl;
	else if(x[1]>=a) cout<<x[n-1]-a<<endl;
	else{
		ans=min(ans,abs(a-x[n])+abs(x[n]-x[2]));
		ans=min(ans,abs(a-x[1])+abs(x[1]-x[n-1]));
		ans=min(ans,abs(a-x[2])+abs(x[2]-x[n]));
		ans=min(ans,abs(a-x[n-1])+abs(x[1]-x[n-1]));
		cout<<ans<<endl;
	}
}
/*
6 -9
-10 -7 4 -7 0 3
*/