# PROBLEM LINK:

Practice

Contest: Division 1

Contest: Division 2

Contest: Division 3

Contest: Division 4

* Authors:* shubham_grg

*iceknight1093, tabr*

**Testers:***iceknight1093*

**Editorialist:**# DIFFICULTY:

TBD

# PREREQUISITES:

None

# PROBLEM:

You have an array A of N integers between 1 and 100. Let M be its minimum.

In one move, you can change A_i to any integer you like between 1 and 100.

What’s the minimum number of moves needed to make M the maximum element?

# EXPLANATION:

For M to be the maximum, the array can’t contain any elements larger than M.

So, every element larger than M requires at least one move, since it must be reduced to M (or something less than M).

Since M is the minimum element of the original array, the number of such elements is exactly N - x, where x is the number of times M appears in A.

So, use a loop to find x: the number of times M occurs in A.

Then, the answer is N - x.

# TIME COMPLEXITY

\mathcal{O}(N) per test case.

# CODE:

## Editorialist's code (Python)

```
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
print(n - a.count(min(a)))
```