CF651B.Beautiful Paintings

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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}>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}>a_{i} , after the optimal rearrangement.

输入输出样例

输入#1
```
5
20 30 10 50 40
```
输出#1
```
4
```
输入#2
```
4
200 100 100 200
```
输出#2
```
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$ .

首页