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

using namespace std;

int n;
int a[500000];

int main()
{
    int tmp;
    scanf("%d", &n);
    for (int i=0; i<n; i++)
    {
        scanf("%d", &tmp);
        a[tmp-1]++;
    }

    sort(a, a+n, greater<int>());

    int w1 = 0;
    int w2 = n;
    int ans = 0;

    while (w1 <= w2)
    {
        tmp = a[w1];
        while (w1 <= w2)
        {
            if (tmp-a[w2] > 0)
            {
                tmp -= a[w2];
                w2--;
            }
            else
            {
                a[w2] -= tmp-1;
                break;
            }
        }
        ans++;
        w1++;
    }

    printf("%d", ans);

    return 0;
}