B. Array Stabilization cf div3 529

B. Array Stabilization
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given an array ?
consisting of ?

integer numbers.

Let instability of the array be the following value: max?=1???−min?=1???.
You have to remove exactly one element from this array to minimize instability of the resulting (?−1)-elements array. Your task is to calculate the minimum possible instability.
Input
The first line of the input contains one integer ?
(2≤?≤105) — the number of elements in the array ?
.
The second line of the input contains ?
integers ?1,?2,…,?? (1≤??≤105) — elements of the array ?
.
Output
Print one integer — the minimum possible instability of the array if you have to remove exactly one element from the array ?
.
Examples
Input
Copy

4
1 3 3 7

Output
Copy

2

Input
Copy

2
1 100000

Output
Copy

0

Note
In the first example you can remove 7
then instability of the remaining array will be 3−1=2
.
In the second example you can remove either 1
or 100000 then instability of the remaining array will be 100000−100000=0 and 1−1=0
correspondingly.

#include<bits/stdc++.h>
using namespace std;
int a[100010];
int main()
{
    int n,i;
    scanf("%d",&n);
    for(i = 0; i < n; i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a,a+n);
    if(n == 2)
        printf("0\n");
    else
    {
        printf("%d\n",min(a[n-2] -a[0],a[n-1] - a[1]));
    }
    return 0;
}