Water Equalization Problem Statement

You are provided with an array ARR of positive integers. Each integer represents the number of liters of water in a bucket. The goal is to make the liters of water in every bucket equal.

You can perform the following operations any number of times:

• Completely remove a bucket from the sequence.
• Draw some amount of water from a bucket.

Determine the minimum number of liters of water that need to be removed to ensure all buckets contain the same amount of water.

Input:

The first line contains an integer ‘T’ representing the number of test cases. Each test case consists of: 
 - A line with a single integer ‘N’, indicating the number of elements in the array ARR. 
 - A line containing ‘N’ space-separated integers representing the elements of ARR.

Output:

For each test case, output a single integer, representing the minimum liters of water to remove. Print each result on a new line.

Example:

Input:

N = 4, ARR = [1, 1, 2, 2]

Output:

2

Explanation:

Choosing to equalize all buckets to 1 liter, 1 liter needs to be removed from the third and fourth buckets, totaling 2 liters removed.

Constraints:

• 1 <= T <= 5
• 1 <= N <= 2000
• 1 <= ARR[i] <= 100

Where ‘T’ is the number of test cases, ‘N’ is the number of buckets, and ARR[i] is the amount of water in the i-th bucket. The time limit is 1 second.