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

using namespace std;



unordered_map<int,int> counts;
vector<int> sorted_counts;

int main(int argc, char const *argv[])
{
    ios_base::sync_with_stdio(0);

    int n;
    int k;
    cin>>n;

    for (size_t i = 0; i < n; i++)
    {
        cin>>k;
        auto it = counts.find(k);
        if( it ==  counts.end())
            counts[k] = 1;
        else
            counts[k]++;
    }
    for (auto& item : counts){
        sorted_counts.push_back(item.second);
    }
    
    sort(sorted_counts.begin(),sorted_counts.end(), std::greater<>());
    
    int result = 0;

    for (size_t i = 0; i < n; i++)
    {
        result = 0;
        for (size_t j = 0; j < n; j++) {
            if (sorted_counts[j] >= (i+1))
                result += (sorted_counts[j]/(i+1))*(i+1);
            else
                break;
        }
        cout<<result<<" ";
    }
    
    cout<<"\n";
    return 0;
}