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
#include <iostream>
#include <algorithm>
#include <vector>

int tab[500001];
std::pair<int, int> max;
std::vector<int> v;

int main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);

    int n, x;

    std::cin >> n;
    for (int i = 0; i < n; i++) {
        std::cin >> x;
        tab[x]++;
    }

    for (int i = 0; i <= n; i++)
        if (tab[i] != 0)
            v.push_back(tab[i]);
    
    std::sort(v.begin(), v.end());

    int counter = 1, index = 0;
    while (index != v.size() - 1) {
        if (v.back() > v[index]) {
            v.back() -= v[index];
            index++;
        }
        else {
            v[index] -= (v.back() - 1);
            v.pop_back();
            counter++;
        }
    }

    std::cout << counter;

}