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
#include<bits/stdc++.h>
using namespace std;

/*
*/

# define int int64_t

const int64_t mod = 1e9+7;
const int maxn = 1e6+10;
int n;
int a[maxn];
pair<int, int> cnt[maxn];


void tc()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cnt[i].second = i;
        cin >> a[i];
        cnt[a[i]].first++;
    }
    sort(cnt+1, cnt+1+n);

    int j = 1;
    int k = 0;
    for (int i = n; i >= 1 && j <= i; i--)
    {
        if (cnt[i].first > 0)
        {
            k++;
            int poz = cnt[i].first-1;
            while (poz > 0 && j <= i)
            {
                int od = min(poz, cnt[j].first);
                poz -= od;
                cnt[j].first -= od;
                if (cnt[j].first == 0)
                {
                    j++;
                }
            }
        }
    }
    cout << k << endl;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    tc(); return 0;

    int T; cin >> T;
    while (T--) tc();

    return 0;
}