1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i =(a); i < (b); ++i)
#define re(i, n) FOR(i, 1, n)
#define ford(i, a, b) for(int i = (a); i >= (b); --i)
#define rep(i, n) for(int i = 0;i <(n); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<pll> vpll;
typedef vector<pii> vpii;

const ll inf = 1e18;
const int N = 500'005;
const int mod = 1e9 + 7;

int cnt[N] = {0};

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    rep(i, n)
    {
        int v;
        cin >> v;
        cnt[v]++;
    }
    sort(cnt, cnt + N);
    int head = N;
    int tail = 0;
    int ans = 0;
    int cnt2 = 0;
    while (head > tail)
    {
        if (cnt[tail] == 0) tail++;
        else if (cnt2 == 0)
        {
            cnt2 += cnt[--head] -1;
            ans++;
        }
        else
        {
            cnt[tail]--;
            cnt2--;
        }
    }
    cout << ans << '\n';
}