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
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> z (n, 0);
    for (int i = 0; i < n; i++) {
        cin >> z[i];
    }
    sort(z.begin(), z.end());
    vector<int> g;
    int r = 1;
    int nr = z[0];
    for (int i = 1; i < n; i++) {
        if (z[i] == nr) {
            r++;
        }
        else {
            g.push_back(r);
            r = 1;
            nr = z[i];
        }
    }
    g.push_back(r);
    sort(g.begin(), g.end(), greater<int>());
    int j = 0;
    vector<int> w (n+1, 0);
    vector<int> d;
    for (int i = n; i > 0; i--) {
        while (i == g[j]) {
            d.push_back(i);
            j++;
        }
        for (int x : d) {
            w[i] += x/i;
        }
    }
    for (int i = 1; i < n+1; i++) {
        cout << w[i]*i << ' ';
    }
}