Arena

题意翻译

$n$ 个英雄在竞技场战斗，初始时第 $i$ 位英雄有能力值 $a_i$。 现在竞技场将进行对决，每分钟都会出现随机的两位（不同的）英雄战斗，最终能力值高的获胜（能力值一样时平局），并且获胜者能力值上升 $1$（平局时没有英雄的能力值会上升）。 当一位英雄的获胜次数超过 $100^{500}$ 时，对决结束，该英雄成为赢家。现在请你统计多少英雄可能成为赢家。 $T$ 组数据。 $1\leq T\leq500;$ $1\leq n,a_i\leq100;$

题目描述

$ n $ heroes fight against each other in the Arena. Initially, the $ i $ -th hero has level $ a_i $ . Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute). When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by $ 1 $ . The winner of the tournament is the first hero that wins in at least $ 100^{500} $ fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament. Calculate the number of possible winners among $ n $ heroes.

输入输出格式

输入格式

The first line contains one integer $ t $ ( $ 1 \le t \le 500 $ ) — the number of test cases. Each test case consists of two lines. The first line contains one integer $ n $ ( $ 2 \le n \le 100 $ ) — the number of heroes. The second line contains $ n $ integers $ a_1, a_2, \dots, a_n $ ( $ 1 \le a_i \le 100 $ ), where $ a_i $ is the initial level of the $ i $ -th hero.

输出格式

For each test case, print one integer — the number of possible winners among the given $ n $ heroes.

输入输出样例

输入样例 #1

3
3
3 2 2
2
5 5
4
1 3 3 7

输出样例 #1

1
0
3

说明

In the first test case of the example, the only possible winner is the first hero. In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.