#include <bits/stdc++.h> using namespace std; unordered_map<int, int> ct; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for(int i = 0; i < n; i++) { int a; cin >> a; ct[a]++; } vector<int> cs; for(auto c: ct) { cs.push_back(c.second); } sort(cs.begin(), cs.end(), greater<>()); int i = 1; for(; i <= n; i++) { int s = 0; for(auto c: cs) { s += (c/i)*i; if(c/i == 0) { cs.pop_back(); } } cout << s << " "; } for(; i <= n; i++) { cout << 0 << " "; } cout << "\n"; return 0; }
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 | #include <bits/stdc++.h> using namespace std; unordered_map<int, int> ct; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for(int i = 0; i < n; i++) { int a; cin >> a; ct[a]++; } vector<int> cs; for(auto c: ct) { cs.push_back(c.second); } sort(cs.begin(), cs.end(), greater<>()); int i = 1; for(; i <= n; i++) { int s = 0; for(auto c: cs) { s += (c/i)*i; if(c/i == 0) { cs.pop_back(); } } cout << s << " "; } for(; i <= n; i++) { cout << 0 << " "; } cout << "\n"; return 0; } |