Beautiful Paintings

## 题目描述 有n幅画，第i幅画的好看值为a[i]。游客在从一幅画走到更漂亮的一幅画时会很高兴。画可以以任意顺序码放，游客从头至尾走一遍，高兴次数的最大值为c。求c的最大值。 ## 输入输出格式 ### 输入格式： 输入的第一行包含一个正整数n（1<=n<=1000)。 输入的第二行包含一个数组a[1]、a[2]、a[3]、...、a[n]（1<=a[i]<=1000） ### 输出格式： 输出共一行，包含一个正整数c。 ## 说明 在第一个例子中，最佳顺序为：10、20、30、40、50。 在第二个例子中，最佳顺序为：100、200、100、200。

There are $ n $ pictures delivered for the new exhibition. The $ i $ -th painting has beauty $ a_{i} $ . We know that a visitor becomes happy every time he passes from a painting to a more beautiful one. We are allowed to arranged pictures in any order. What is the maximum possible number of times the visitor may become happy while passing all pictures from first to last? In other words, we are allowed to rearrange elements of $ a $ in any order. What is the maximum possible number of indices $ i $ ( $ 1<=i<=n-1 $ ), such that $ a_{i+1}&gt;a_{i} $ .

The first line of the input contains integer $ n $ ( $ 1<=n<=1000 $ ) — the number of painting. The second line contains the sequence $ a_{1},a_{2},...,a_{n} $ ( $ 1<=a_{i}<=1000 $ ), where $ a_{i} $ means the beauty of the $ i $ -th painting.

Print one integer — the maximum possible number of neighbouring pairs, such that $ a_{i+1}&gt;a_{i} $ , after the optimal rearrangement.

5
20 30 10 50 40

4

4
200 100 100 200

2

In the first sample, the optimal order is: $ 10,20,30,40,50 $ . In the second sample, the optimal order is: $ 100,200,100,200 $ .