Codeforces-1008C - Reorder the Array - 水題

題解鏈接

https://www.lucien.ink/archives/307/

---

題目鏈接

http://codeforces.com/contest/1008/problem/C

---

題目

You are given an array of integers. Vasya can permute (change order) its integers. He wants to do it so that as many as possible integers will become on a place where a smaller integer used to stand. Help Vasya find the maximal number of such integers.

For instance, if we are given an array [10,20,30,40]$[10,20,30,40]$ , we can permute it so that it becomes [20,40,10,30]$[20,40,10,30]$ . Then on the first and the second positions the integers became larger (20>10$20>10$ , 40>20$40>20$ ) and did not on the third and the fourth, so for this permutation, the number that Vasya wants to maximize equals 2$2$ . Read the note for the first example, there is one more demonstrative test case.

Help Vasya to permute integers in such way that the number of positions in a new array, where integers are greater than in the original one, is maximal.

Input

The first line contains a single integer n$n$ (1≤n≤105$1\le n\le {10}^5$ ) — the length of the array.

The second line contains n$n$ integers a1,a2,…,an$a_1,a_2,\dots ,a_n$ (1≤ai≤109$1\le a_i\le {10}^9$ ) — the elements of the array.

Output

Print a single integer — the maximal number of the array’s elements which after a permutation will stand on the position where a smaller element stood in the initial array.

Input

7
10 1 1 1 5 5 3

Output

4

Input

5
1 1 1 1 1

Output

0

Note

In the first sample, one of the best permutations is [1,5,5,3,10,1,1]$[1,5,5,3,10,1,1]$ . On the positions from second to fifth the elements became larger, so the answer for this permutation is 4.

In the second sample, there is no way to increase any element with a permutation, so the answer is 0.

---

題意

  給你一個序列，你可以生成這個序列的任意一個排列，對於某個排列，如果這個排列上某個位置的值大於原序列的值，那麼就會產生1的貢獻，問你最大能有多少貢獻。

---

思路

  直接排序一下貪心即可。

---

實現

#include <bits/stdc++.h>
const int maxn = int(1e5) + 7;
int a[maxn], n, r = 1, ans;
int main() {
    std::cin >> n;
    for (int i = 1; i <= n; i++) std::cin >> a[i];
    std::sort(b + 1, b + 1 + n);
    for (int i = 1; i <= n; i++) {
        while (r <= n && a[r] <= a[i]) r++;
        if (r <= n) ans++, r++;
    }
    std::cout << ans << std::endl;
    return 0;
}