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

#define pb push_back

using namespace std;


int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);	
    
    int n;
    cin >> n;
    vector<int> v;
    for(int i = 0; i < n; i++) {
        int k; cin >> k;
        v.pb(k);
    }
    
    sort(v.begin(), v.end());
    vector<int> lic;
    
    int j = 0;
    while(j < n){
        int c = v[j];
        int count = 0;
        
        while(j < n  &&  v[j] == c) {
            j++;
            count++;
        }
        lic.pb(count);
    }
    sort(lic.begin(), lic.end());
    
    
    int r = lic.size() - 1;
    
    int sum = 0, ans = 0;
    while(sum < n) {
        sum += 2 * lic[r] - 1;
        ans++;
        r--;
    }
    
    cout << ans << "\n";

	
    return 0;
}