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

using namespace std;

typedef map<int, int> CountMap;
CountMap counts;

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

    int n;
    cin >> n;

    int a;
    for (int i = 0; i < n; i++) {
        cin >> a;

        auto it(counts.find(a));
        if (it != counts.end()) {
            it->second++;
        } else {
            counts[a] = 1;
        }
    }

    auto vals = std::views::values(counts);
    std::vector<int> values{ vals.begin(), vals.end() };
    std::sort(std::begin(values), std::end(values), greater<int>());

    bool first = true;
    for(int i = 1; i <= n; i++) {
        int res = 0;
        for (auto & value : values) {
            if(value < i) {
                break;
            }
            res += value / i;
        }

        if(first) {
            first = false;
        } else {
            cout << " ";
        }
        cout << (res*i);
    }

    cout << endl;

    return 0;
}