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

constexpr int MAXN = 5e5 + 5;

int tab[MAXN];

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

    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> tab[i];

    sort(tab + 1, tab + n + 1);

    priority_queue<int> nums;
    int temp = 0;
    for (int i = 1; i <= n; i++)
    {
        temp++;
        if (tab[i] != tab[i + 1])
        {
            nums.push(temp);
            temp = 0;
        }
    }

    int cnt = 0;
    while (nums.size() && n > 0)
    {
        int a = nums.top();
        nums.pop();
        n -= 2 * a - 1;
        cnt++;
    }

    cout << cnt << '\n';

    return 0;
}