AIM Tech Round 3 (Div. 2) -- B. Checkpoints （枚举）

大体题意：

告诉你的位置，一共有n 个地方，你要去n-1个地方，求你最少的总距离？

思路：

被终测掉了，记录一下这个题吧！

因为要去n-1个地方！ 所以最后一个地方或者第一个地方不去 这是最优解！

因此两个地方讨论一下！

排好序后：

如果你的位置比第一个还小，那么不要去最后一个地方，

如果你位置比最后一个地方大，那不要去第一个地方！

如果在中间，考虑先走哪一个就好了！

#include<bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
const int inf = 0x3f3f3f3f;
int a[maxn];
int solve(int x,int y,int z){
    if (z <= x)return y-z;
    if (z >= y)return z-x;
    return min(z-x+y-x,y-z+y-x);
}
int main(){
    int n,s;
    scanf("%d %d",&n,&s);
    for (int i = 1; i <= n; ++i)scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    if (n == 1) return 0 * puts("0");
    if (s <= a[1]){
        return 0 * printf("%d\n",a[n-1]-s);
    }
    else if (s >= a[n]){
        return 0 * printf("%d\n",s-a[2]);
    }
    else {
        int ans = inf;
        ans = min(ans,solve(a[1],a[n-1],s));
        ans = min(ans,solve(a[2],a[n],s));
        return 0 * printf("%d\n",ans);
    }
    return 0;
}

B. Checkpoints

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya takes part in the orienteering competition. There are n checkpoints located along the line at coordinates x₁, x₂, ..., x_n. Vasya starts at the point with coordinate a. His goal is to visit at least n - 1 checkpoint in order to finish the competition. Participant are allowed to visit checkpoints in arbitrary order.

Vasya wants to pick such checkpoints and the order of visiting them that the total distance travelled is minimized. He asks you to calculate this minimum possible value.

Input

The first line of the input contains two integers n and a (1 ≤ n ≤ 100 000,  - 1 000 000 ≤ a ≤ 1 000 000) — the number of checkpoints and Vasya's starting position respectively.

The second line contains n integers x₁, x₂, ..., x_n ( - 1 000 000 ≤ x_i ≤ 1 000 000) — coordinates of the checkpoints.

Output

Print one integer — the minimum distance Vasya has to travel in order to visit at least n - 1 checkpoint.

Examples

Input

3 10
1 7 12

Output

7

Input

2 0
11 -10

Output

10

Input

5 0
0 0 1000 0 0

Output

0

Note

In the first sample Vasya has to visit at least two checkpoints. The optimal way to achieve this is the walk to the third checkpoints (distance is 12 - 10 = 2) and then proceed to the second one (distance is 12 - 7 = 5). The total distance is equal to 2 + 5 = 7.

In the second sample it's enough to visit only one checkpoint so Vasya should just walk to the point  - 10.