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

#define SIZE 500001

using namespace std;


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

    int n {};
    int x {};
    int input_count[SIZE] {};
    int lenght_count[SIZE] {};

    int j {}, k {}, cap {}, result {};

    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> x;
        input_count[x]++;
    }

    for (int i = 1; i < SIZE; i++) {
        lenght_count[input_count[i]]++;
    }

    for (int i = 1; i < SIZE; i++) {
        if (lenght_count[i] > 0) {
            if (j == 0) {
                j = i;
            }
            k = i;
        }
    }

    while (k >= j) {
        cap = k - 1;

        while (cap > 0 && lenght_count[j] > 0) {
            cap -= j;
            lenght_count[j]--;
        }

        if (cap < 0) {
            lenght_count[j]++;
            cap += j;
            result++;
            lenght_count[k]--;
        } else if (cap == 0) {
            result++;
            lenght_count[k]--;
        }

        while (lenght_count[j] == 0) {
            j++;
        }
        
        while (lenght_count[k] == 0) {
            k--;
        }
        
    }
    
    cout << result;

    return 0;
}