題目：

把所給的數(shù)組分成a和b兩個(gè)子數(shù)組（元素不重復(fù)使用），令a數(shù)組的的最大值和b數(shù)組的最小值的差最小，并輸出。

題意：

There are n athletes in front of you. Athletes are numbered from 1 to n from left to right. You know the strength of each athlete — the athlete number i has the strength si.

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 A and B so that the value |max(A)?min(B)| is as small as possible, where max(A) is the maximum strength of an athlete from team A, and min(B) is the minimum strength of an athlete from team B.

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

first team: A=[1,2,4],
second team: B=[3,6].
In this case, the value |max(A)?min(B)| will be equal to |4?3|=1. This example illustrates one of the ways of optimal split into two teams.

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

Input

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

Each test case consists of two lines.

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

The second line contains n positive integers s1,s2,…,sn (1≤si≤1000), where si — is the strength of the i-th athlete. Please note that s values may not be distinct.

Output

For each test case print one integer — the minimum value of |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

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
1
0
2
999
50

Note

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

分析：

也就是找數(shù)列中兩元素的差的最小值；先將sort數(shù)組排序，遍歷找相鄰的元素差

AC代碼：

#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; const int M=1e3+10; const int inf=0x3f3f3f3f; int t,n,ans; int dp[M]; int main() {scanf("%d",&t);while(t--){ans=inf;scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d",&dp[i]);sort(dp,dp+n);for(int i=1;i<n;i++)ans=min(ans,dp[i]-dp[i-1]);printf("%d\n",ans);}return 0; }

總結(jié)

以上是生活随笔為你收集整理的Honest Coach CodeForces - 1360B(简单贪心)的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。