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
#include <iostream>
#include <algorithm>

using namespace std;
int a[500009], l, wyn;

int main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
cin >> l;

for (int i = 0; i < l; ++i)
{
    cin >> a[i];
}
sort (a,a+l);

for (int i = 0; i < l; ++i)
{
    int p = i, k = i+1;
    if (a[p] == a[k])
    {
        ++wyn;
        ++i;
        continue;
    }
    int war = a[k];
    int dl = 2, wyst = 1;
    while (k < l)
    {
        ++k;

        if (a[k] == a[k-1]) ++wyst;


        if (dl < 2*wyst)
        {
            ++wyn;
            break;
        }
        ++dl;
    }
}

cout << wyn;

    return 0;
}