402817: GYM100889 A A Beautiful Array

Little Tinu is a handsome kid and likes only beautiful things. He has an array and wants its most beautiful permutation. The beauty of a 1-indexed array A is defined as:

The first line contains T(1 ≤ T ≤ 10), the number of test cases. Every test case contains 2 lines. First line has an integer N(1 ≤ N ≤ 10³), the size of the array A. Second line contains the array A as space separated integers(0 ≤ A_i ≤ 10⁶).

Output for each test case, the maximum beauty of any permutation of the array A.

2
3
3 2 1
4
1 40 70 40

2
69

Sample test case 1:

There are 6 permutations possible:

Beauty  = 2

Beauty  = 1

Beauty  = 1

Beauty  =  - 1

Beauty  =  - 1

Beauty  =  - 2

Maximum of all beauties is 2.

Sample test case 2:

The best permutation is [1, 40, 70, 40] where beauty is 69.