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
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ssize(a) ((int)(a.size()))

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

    int n;
    cin>>n;
    vector<int>ile(n + 1);
    for(int i = 0; i < n; ++i)
    {
        int a;
        cin>>a;
        ++ile[a];
    }
    sort(ile.begin(), ile.end());
    int odp = 0;
    int j = 0;
    for(int i = n; i >= 0; --i)
    {
        if(ile[i] == 0)
            continue;
        --ile[i];
        ++odp;
        while(ile[i] && j < i)
        {
            while(ile[j] == 0 && j < i)
                ++j;
            if(j == i)
                break;
            int odej = min(ile[i], ile[j]); 
            ile[i] -= odej;
            ile[j] -= odej;
        }
    }
    cout<<odp;
    return 0;
}