#include <bits/stdc++.h> using llu = unsigned long long; using ll = long long; #define int ll using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; map<int, int> cnt; for (int i = 0; i < n; i++) { int x; cin >> x; cnt[x]++; } vector<int> a; for (auto [x, c] : cnt) { a.push_back(c); } sort(a.rbegin(), a.rend()); int cur = 0; int ans = 0; for (auto i : a) { cur += i + i - 1; ans++; if (cur >= n) break; } cout << ans << '\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 | #include <bits/stdc++.h> using llu = unsigned long long; using ll = long long; #define int ll using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; map<int, int> cnt; for (int i = 0; i < n; i++) { int x; cin >> x; cnt[x]++; } vector<int> a; for (auto [x, c] : cnt) { a.push_back(c); } sort(a.rbegin(), a.rend()); int cur = 0; int ans = 0; for (auto i : a) { cur += i + i - 1; ans++; if (cur >= n) break; } cout << ans << '\n'; return 0; } |