#include <bits/stdc++.h>
using namespace std;
int n, a;
int cnt[500002] = {0};
multiset<int> num_counts;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a;
        cnt[a]++;
    }
    for (int i = 1; i <= n; ++i) {
        if (cnt[i] > 0) {
            num_counts.insert(cnt[i]);
        }
    }
    int suf_length = 0;
    int j = 0;
    for (auto it = num_counts.crbegin(); it != num_counts.crend(); ++it) {
        j++;
        suf_length += *it;
        if (n + j <= 2 * suf_length) {
            cout << j;
            break;
        }
    }
    return 0;
}
        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  | #include <bits/stdc++.h> using namespace std; int n, a; int cnt[500002] = {0}; multiset<int> num_counts; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n; for (int i = 0; i < n; ++i) { cin >> a; cnt[a]++; } for (int i = 1; i <= n; ++i) { if (cnt[i] > 0) { num_counts.insert(cnt[i]); } } int suf_length = 0; int j = 0; for (auto it = num_counts.crbegin(); it != num_counts.crend(); ++it) { j++; suf_length += *it; if (n + j <= 2 * suf_length) { cout << j; break; } } return 0; }  | 
            
        
                    English