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
58
59
60
61
62
63
64
65
66
#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second

#define pb push_back
#define vec vector
#define vi vector<int>
#define pi pair<int, int>
#define rep(i, p, k) for (int i = p; i <= k; i++)

#define speed                     \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);

using namespace std;

constexpr int MAXN = 5e5 + 7, LOG = 23, INF = 1e9;

int zlicz[MAXN], N;
multiset<int> secik;

int main()
{
    speed;
    cin >> N;
    rep(i, 1, N)
    {
        int x;
        cin >> x;
        zlicz[x]++;
    }
    rep(i, 1, N)
    {
        if (zlicz[i])
            secik.insert(zlicz[i]);
    }

    int ans = 0;

    while (!secik.empty())
    {
        ans++;
        auto it = secik.end();
        it--;
        int suma = *it - 1;
        secik.erase(it);

        while (!secik.empty() and suma)
        {
            it = secik.begin();
            int akt = *it;
            int minim = min(akt, suma);
            secik.erase(it);
            suma -= minim;
            if (akt - minim)
            {
                secik.insert(akt - minim);
            }
        }
    }
    cout << ans << '\n';
    return 0;
}