题目链接:
http://codeforces.com/problemset/problem/709/B
//想一想搞一搞
#include <stdio.h>
#include <string>
#include <cstring>
#include <queue>
#include <algorithm>
#include <functional>
#include <vector>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <sstream>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
const int MAX=100005;
const int INF=0x3f3f3f3f;
int main()
{
cin.sync_with_stdio(false);
int N,S,A[MAX]= {0};
cin>>N>>S;
for (int i=0; i<N; i++)
cin>>A[i];
if (N==1)
{
cout<<0;
return 0;
}
sort(A,A+N);
int Ans=INF;
if (S<=A[0])
Ans=min(Ans,abs(A[N-2]-S));
if (S>=A[N-1])
Ans=min(Ans,abs(A[1]-S));
if (S<=A[1])
Ans=min(Ans,abs(A[N-1]-S));
if (S>=A[N-2])
Ans=min(Ans,abs(A[0]-S));
int temp1=min(abs(S-A[0])*2+abs(A[N-2]-S),abs(S-A[N-2])*2+abs(S-A[0]));
int temp2=min(abs(S-A[1])*2+abs(A[N-1]-S),abs(S-A[N-1])*2+abs(S-A[1]));
Ans=min(Ans,min(temp1,temp2));
cout<<Ans;
return 0;
}