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
#pragma GCC optimize ("O3")
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, n) for (int i = 0; i < n; i++)
#define f first
#define s second
#define pb push_back
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()

using vi = vector<int>;

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

    map<int, int> ile;
    FOR (i, n)
    {
        int temp;
        cin >> temp;

        ile[temp]++;
    }

    vi vals;
    for (auto [a, b] : ile)
    {
        vals.pb(b);
    }

    sort(all(vals));
    reverse(all(vals));

    int taken = 0;
    for (int i = 0;; i++)
    {
        taken += vals[i];
        if (taken - (i + 1) >= n - taken)
        {
            cout << i + 1 << "\n";
            return;
        }
    }
    assert(false);
}

int main () {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int tests = 1;
    // cin >> tests;

    for (int test = 1; test <= tests; test++) {
        solve();
    }

    return 0;
}