Preparing NOJ

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.

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.

Info

Provider CodeForces

Origin Codeforces Round #345 (Div. 2)

Code CF651B

Tags

greedysortings

Submitted 182

Passed 82

AC Rate 45.05%

Date 03/04/2019 15:12:37

Related