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
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int n;
    cin >> n;
    map<int, int> map;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        map[a]++;
    }
    vector<int> vec(0);
    for (pair<int, int> p : map)
    {
        vec.push_back(p.second);
    }
    sort(vec.begin(), vec.end(), greater<int>());
    int res = 0;
    int i = 0; int j = vec.size() - 1;
    while (i < j) {
        int high = vec[i];
        
        int sum = 0;
        while (i < j) {
            sum += vec[j];
            j--;
            if (high <= sum) {
                j++;
                break;
            }
        }
        i++;
        if (i == j) {
            i++;
            break;
        }
        
    }
    cout << i;
}