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

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    unordered_multiset<int> ms;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        ms.insert(x);
    }

    unordered_set<int> s(ms.begin(), ms.end());
    vector<int> counts;
    for (int x : s)
        counts.push_back(ms.count(x));
    sort(counts.rbegin(), counts.rend());

    int i = 0, j = counts.size() - 1;
    while (i <= j) {
        while (i < j && counts[i] > 1) {
            int val = min(counts[i] - 1, counts[j]);
            counts[i] -= val;
            counts[j] -= val;
            if (counts[j] == 0)
                j--;
        }
        i++;
    }
    cout << i << '\n';
    return 0;
}