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

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, tmp, it, mapsize, seq, cnt = 0;
    map<int, int> mComponents;

    cin >> n;

    for (int i = 0; i < n; i++)
    {
        cin >> tmp;
        mComponents[tmp]++;
    }

    mapsize = mComponents.size();
    vector<int> v(mapsize);

    it = 0;
    for (auto e : mComponents)
    {

        v[it] = e.second;
        it++;
    }

    sort(v.begin(), v.end(), greater<int>());

    seq = n;
    it = 0;
    while (seq > 0)
    {
        seq -= (2 * v[it] - 1);
        it++;
        cnt++;
    }
    cout << cnt << endl;
}