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
#include <bits/stdc++.h>
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

#define fwd(i,a,b) for(int i=(a); i<(b);i++)
#define rep(i,n) for(int i=0; i<(n);i++)
#define ford(i,a,b) for(int i=(a); i>(b);i--)

#define all(X) (X).begin(), (X).end()
#define sz(X)((int)(X).size())

#define st first
#define nd second

#define DEBUG
#ifdef DEBUG
template<typename T1, typename T2> auto& operator<<(ostream& out, const pair<T1, T2>& a) { return out << "(" << a.first << ", " << a.second << ")"; }
template<typename T, typename N> auto& operator<<(N& out, const T& a) { out << "{"; for (const auto& b : a) out << b << ", "; return out << "}"; }
template<typename... Args> void print(Args&&... args) { (cerr << ... << args) << "\n"; }
#define debug(x...) cerr << "[" #x "]: ", print(x)
#else
#define debug(...) ;
#endif

template<typename T>
using Tree = tree <T,  null_type,  less<T>,  rb_tree_tag,  tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

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

    ll n, a;
    cin >> n;
    vector<ll> cnt1(n+1), tab;
    rep(i,n){
        cin >> a;
        cnt1[a]++;
    }
    rep(i,n+1) if(cnt1[i]>0) tab.emplace_back(cnt1[i]);
    sort(all(tab),greater<>());
    ll sum = accumulate(all(tab),0LL);
    ll ans = 0;
    ll cnt = 0;
    rep(i,sz(tab)) {
        if(cnt >= sum) break;
        ans++;
        cnt += tab[i]-1;
        sum -= tab[i];
    }
    cout << ans;

    return 0;
}