#include <bits/stdc++.h> using namespace std; #define rep(a, b) for (int a = 0; a < (b); a++) #define rep1(a, b) for (int a = 1; a <= (b); a++) #define all(x) (x).begin(), (x).end() using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int MOD = 1e9 + 7; #define LOCAL false const int MAX_N = 5e5 + 7; int n; int cnt[MAX_N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); if (LOCAL) { ignore=freopen("io/in", "r", stdin); ignore=freopen("io/out", "w", stdout); } cin >> n; int val; rep(i, n) { cin >> val; cnt[val]++; } sort(cnt+1, cnt+1+n, greater{}); int s = 0; int ans = 0; rep1(i, n) { ans++; s += cnt[i]*2-1; if (s >= 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 38 39 40 41 42 43 | #include <bits/stdc++.h> using namespace std; #define rep(a, b) for (int a = 0; a < (b); a++) #define rep1(a, b) for (int a = 1; a <= (b); a++) #define all(x) (x).begin(), (x).end() using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int MOD = 1e9 + 7; #define LOCAL false const int MAX_N = 5e5 + 7; int n; int cnt[MAX_N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); if (LOCAL) { ignore=freopen("io/in", "r", stdin); ignore=freopen("io/out", "w", stdout); } cin >> n; int val; rep(i, n) { cin >> val; cnt[val]++; } sort(cnt+1, cnt+1+n, greater{}); int s = 0; int ans = 0; rep1(i, n) { ans++; s += cnt[i]*2-1; if (s >= n) break; } cout << ans << '\n'; return 0; } |