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
52
53
54
55
56
57
// clang-format off
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ssize(x) int(x.size())
template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';}
template<typename T,typename = typename enable_if<!is_same<T,string>::value>::type>
auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';}
#ifdef DEBUG
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n'
#else
#define debug(...) {}
#endif
// clang-format on

int n, a, odp;
vector<int> l;
vector<int> ilosci;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 0; i < n + 2; i++)
        ilosci.push_back(0);
    for (int i = 0; i < n; i++)
    {
        cin >> a;
        l.push_back(a);
        ilosci[a]++;
    }
    sort(ilosci.begin(), ilosci.end());
    reverse(ilosci.begin(), ilosci.end());
    // cout << ilosci << endl;
    int pocz = 0, kon = n - 1, wziete = 0;
    while (ilosci[kon] == 0)
        kon--;
    while (pocz <= kon)
    {
        // cout << pocz << " " << kon << endl;
        if (ilosci[pocz] != 0)
            odp++;
        while (pocz < kon && ilosci[pocz] - wziete - 1 >= ilosci[kon])
        {
            wziete += ilosci[kon];
            ilosci[kon] = 0;
            kon--;
        }
        ilosci[kon] = max(0, ilosci[kon] - (ilosci[pocz] - wziete - 1));
        pocz++;
        wziete = 0;
    }
    cout << odp << endl;
    return 0;
}