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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <chrono>
#include <map>
#include <assert.h>
#include <fstream>
#include <cstdlib>
#include <random>
#include <iomanip>
#include <queue>
#include <random>
#include <unordered_map>
 
using namespace std;

#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()

const int MOD = (int) 1e9 + 7;

void solve() {
    int n;
    cin >> n;

    vector<int> a(n);
    vector<int> b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        --a[i];

        ++b[a[i]];
    }

    vector<pair<int, int> > c;
    for (int i = 0; i < n; ++i) {
        if (b[i]) {
            c.push_back({b[i], i});
        }
    }

    sort(all(c));

    int ans = 0;
    int l = 0;
    int r = c.size() - 1;

    while (l <= r) {
        if (l == r) {
            ++ans;
            break;
        }

        int temp = c[r].first - 1;
        --r;
        ++ans;

        while (l <= r && temp) {
            int mn = min(temp, c[l].first);

            c[l].first -= mn;
            temp -= mn;

            if (c[l].first == 0) {
                ++l;
            }
        }
    }

    cout << ans << "\n";
}

int main() {
    // freopen("input.txt", "r", stdin);
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int tests = 1;
    // cin >> tests;

    for (int i = 0; i < tests; ++i) {
        solve();
    }
}