#include <iostream> #include <string> #include <algorithm> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> cnt(n + 1); int x; for (int i = 0; i < n; ++i) { cin >> x; ++cnt[x]; } sort(cnt.begin(), cnt.end(), greater<>()); int s = 0; int k = 0; for (; s < n; ++k) { s += cnt[k] - 1; n -= cnt[k]; } cout << k; }
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 | #include <iostream> #include <string> #include <algorithm> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> cnt(n + 1); int x; for (int i = 0; i < n; ++i) { cin >> x; ++cnt[x]; } sort(cnt.begin(), cnt.end(), greater<>()); int s = 0; int k = 0; for (; s < n; ++k) { s += cnt[k] - 1; n -= cnt[k]; } cout << k; } |