AIM Tech Round 3 (Div. 2) B. Checkpoints 排序、讨论

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 x1, x2, ..., xn. 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 x1, x2, ..., xn ( - 1 000 000 ≤ xi ≤ 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.

Source

AIM Tech Round 3 (Div. 2)

My Solution

 排序、讨论

if(a < val[0]) ans = val[n - 2] - a;

else if(a > val[n - 1]) ans = a - val[1];

else 1 : min(ans舍去val[0], ans舍去val[n-1]) 处理的时候注意 a > val[0] && a < val[1] 和 a < val[n-1] && a > val[n-2 ]的情况

此外就是 n == 1的时候了

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 8;

LL val[maxn];

int main()
{
    #ifdef LOCAL
    freopen("b.txt", "r", stdin);
    //freopen("o.txt", "w", stdout);
    int T = 4;
    while(T--){
    #endif // LOCAL
    ios::sync_with_stdio(false);
    cin.tie(0);

    LL n, a, ans = 0, l, r;
    cin>>n>>a;
    for(int i = 0; i < n; i++){
        cin>>val[i];
    }

    sort(val, val + n);

    if(a < val[0]){
        ans = val[n - 2] - a;
    }
    else if(a > val[n - 1]){
        ans = a - val[1];
    }
    else{
        l = a - val[0];
        if(val[n - 2] > a) r = val[n - 2] - a;
        else r = 0;
        ans = min(2*l + r, l + 2*r);


        if(a > val[1]) l = a - val[1];
        else l = 0;
        r = val[n - 1] - a;
        ans = min(ans, min(2*l + r, l + 2*r));
    }
    if(n == 1) ans = 0;
    cout<<ans<<endl;


    #ifdef LOCAL
    cout<<endl;
    }
    #endif // LOCAL
    return 0;
}

  Thank you!

                                                                                                                                               ------from ProLights