Make them equal

 Chef has an array 

A$A$ having N$N$ elements. Chef wants to make all the elements of the array equal by repeating the following move.

• Choose any integer K$K$ between 1$1$ and N$N$ (inclusive). Then choose K$K$ distinct indices i1,i2,…,iK$i_1,i_2,\dots ,i_K$, and increase the values of Ai1,Ai2,…,AiK$A_{i_1},A_{i_2},\dots ,A_{i_K}$ by 1$1$.

Find the minimum number of moves required to make all the elements of the array equal.

Input Format

• The first line contains T$T$ denoting the number of test cases. Then the test cases follow.
• The first line of each test case contains a single integer N$N$ denoting the number of elements in A$A$.
• The second line of each test case contains N$N$ space separated integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$.

Output Format

For each test case, print a single line containing one integer denoting the minimum number of moves required to make all the elements of the array equal.

Constraints

• 1≤T≤104$1\le T\le {10}^4$
• 1≤N≤105$1\le N\le {10}^5$
• 1≤Ai≤105$1\le A_i\le {10}^5$
• The sum of N$N$ over all test cases does not exceed 105${10}^5$.

Sample Input 1 

2
3
1 3 1
3
2 2 2

Sample Output 1 

2
0

Explanation

• Test Case 1$1$: In the first move, Chef can choose K=2$K=2$, and choose the indices {1,3}$\{1,3\}$. After increasing A1$A_1$ and A3$A_3$ by 1$1$, the array will become [2,3,2]$[2,3,2]$. In the second move, Chef can choose K=2$K=2$, and choose the indices {1,3}$\{1,3\}$. After increasing A1$A_1$ and A3$A_3$ by 1$1$, the array will become [3,3,3]$[3,3,3]$, and hence all the elements become equal.

• Test Case 2$2$: All the elements of the array are equal, hence no move is required.

• Tweet
• Share
• Share
• Share
• Share

Related Post