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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n;
    std::cin >> n;

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

    std::unordered_map<int, int> freqByElem;
    for (const auto &elem : a) {
        freqByElem[elem]++;
    }

    std::vector<std::pair<int, int>> elemFreqPairs;
    std::copy(freqByElem.begin(), freqByElem.end(), std::back_inserter(elemFreqPairs));

    std::sort(elemFreqPairs.begin(), elemFreqPairs.end(), [](auto &lhs, auto &rhs) {
        return lhs.second < rhs.second;
    });

    std::deque<std::pair<int, int>> deq;
    std::copy(elemFreqPairs.begin(), elemFreqPairs.end(), std::back_inserter(deq));

    int ans = 0;

    while (!deq.empty()) {
        auto& highPair = deq.back();
        deq.pop_back();

        int remaining = highPair.second - 1;

        while (!deq.empty() && remaining != 0) {
            auto& lowPair = deq.front();
            if (lowPair.second <= remaining) {
                remaining -= lowPair.second;
                deq.pop_front();
            } else {
                lowPair.second -= remaining;
                remaining = 0;
            }
        }

        ans++;

        if (deq.empty() && remaining != 0) {
            break;
        }
    }

    cout << ans << "\n";

    return;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
  
    return 0;
}