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

void solve() {
    int n; cin >> n;
    vector<int> cnt(n + 1, 0);
    for(int i = 0; i < n; i++) {
        int x; cin >> x;
        cnt[x]++;
    }
    sort(cnt.begin(), cnt.end());
    int l = 0, r = n, ans = 1;
    while(l != r) {
        if(cnt[l] < cnt[r]) {
            cnt[r] -= cnt[l];
            l++;
        } else {
            cnt[l] -= cnt[r] - 1;
            r--;
            ans++;
        }
    }
    cout << ans << "\n";
}

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

    int t = 1; //cin >> t;
    while(t--) solve();
    return 0;
}