cf1360BCodeforces Round #644 (Div. 3)B

B. Honest Coach

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are nn athletes in front of you. Athletes are numbered from 11 to nn from left to right. You know the strength of each athlete — the athlete number ii has the strength sisi.

You want to split all athletes into two teams. Each team must have at least one athlete, and each athlete must be exactly in one team.

You want the strongest athlete from the first team to differ as little as possible from the weakest athlete from the second team. Formally, you want to split the athletes into two teams AA and BB so that the value |max(A)−min(B)||max(A)−min(B)| is as small as possible, where max(A)max(A) is the maximum strength of an athlete from team AA, and min(B)min(B) is the minimum strength of an athlete from team BB.

For example, if n=5n=5 and the strength of the athletes is s=[3,1,2,6,4]s=[3,1,2,6,4], then one of the possible split into teams is:

• first team: A=[1,2,4]A=[1,2,4],
• second team: B=[3,6]B=[3,6].

In this case, the value |max(A)−min(B)||max(A)−min(B)| will be equal to |4−3|=1|4−3|=1. This example illustrates one of the ways of optimal split into two teams.

Print the minimum value |max(A)−min(B)||max(A)−min(B)|.

Input

The first line contains an integer tt (1≤t≤10001≤t≤1000) — the number of test cases in the input. Then tt test cases follow.

Each test case consists of two lines.

The first line contains positive integer nn (2≤n≤502≤n≤50) — number of athletes.

The second line contains nn positive integers s1,s2,…,sns1,s2,…,sn (1≤si≤10001≤si≤1000), where sisi — is the strength of the ii-th athlete. Please note that ss values may not be distinct.

Output

For each test case print one integer — the minimum value of |max(A)−min(B)||max(A)−min(B)| with the optimal split of all athletes into two teams. Each of the athletes must be a member of exactly one of the two teams.

Example

input

Copy

5
5
3 1 2 6 4
6
2 1 3 2 4 3
4
7 9 3 1
2
1 1000
3
100 150 200

output

Copy

1
0
2
999
50

Note

Problem - B - Codeforces

The first test case was explained in the statement. In the second test case, one of the optimal splits is A=[2,1]A=[2,1], B=[3,2,4,3]B=[3,2,4,3], so the answer is |2−2|=0|2−2|=0.

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=1e5+10;
int a[N];
int t,n;
int main()
{
    cin>>t;
    while(t--)
    {
        cin>>n;
        memset(a,0,sizeof a);
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        sort(a,a+n);
        int Min=a[1]-a[0];
        for(int i=2;i<n;i++)
        {
            Min=min(Min,a[i]-a[i-1]);
        }
        cout<<Min<<endl;
    }
}

 啦啦啦，战歌一响，斗志拉满！