#include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define all(x) (x).begin(), (x).end() #define mid ((l+r)/2) #define siz(x) (int)(x).size() #define BOOST ios_base::sync_with_stdio(0), cin.tie(0) #define deb(x) cout << #x << ": " << x << "\n" typedef long long ll; typedef long double ld; typedef pair<int, int> ii; int main(){ BOOST; int n; cin >> n; vector<int> t(n); for(int i=0; i<n; i++){ int x; cin >> x; x--; t[x]++; } sort(all(t), greater<int>()); int ans = 0, sum = 0; for(int i=0; i<n; i++){ if(sum < n){ sum += t[i] + t[i]-1; ans++; } } cout << ans << "\n"; }
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 | #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define all(x) (x).begin(), (x).end() #define mid ((l+r)/2) #define siz(x) (int)(x).size() #define BOOST ios_base::sync_with_stdio(0), cin.tie(0) #define deb(x) cout << #x << ": " << x << "\n" typedef long long ll; typedef long double ld; typedef pair<int, int> ii; int main(){ BOOST; int n; cin >> n; vector<int> t(n); for(int i=0; i<n; i++){ int x; cin >> x; x--; t[x]++; } sort(all(t), greater<int>()); int ans = 0, sum = 0; for(int i=0; i<n; i++){ if(sum < n){ sum += t[i] + t[i]-1; ans++; } } cout << ans << "\n"; } |