#include <bits/stdc++.h> #define ll long long #define ld long double #define endl '\n' #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define all(x) (x).begin(), (x).end() using namespace std; int inf=1000000007; ll infl=1000000000000000007; ll mod=1000000007; ll mod1=998244353; const int N=500007; int ile[N]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; for(int i=1;i<=n;i++) { int x; cin>>x; ile[x]++; } vector<int>V; for(int i=1;i<=n;i++) V.pb(ile[i]); sort(all(V),greater<int>()); int S=0; for(int i=1;i<=n;i++) { S+=V[i-1]; if(S-i>=n-S) { cout<<i<<endl; break; } } 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 47 48 49 50 | #include <bits/stdc++.h> #define ll long long #define ld long double #define endl '\n' #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define all(x) (x).begin(), (x).end() using namespace std; int inf=1000000007; ll infl=1000000000000000007; ll mod=1000000007; ll mod1=998244353; const int N=500007; int ile[N]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; for(int i=1;i<=n;i++) { int x; cin>>x; ile[x]++; } vector<int>V; for(int i=1;i<=n;i++) V.pb(ile[i]); sort(all(V),greater<int>()); int S=0; for(int i=1;i<=n;i++) { S+=V[i-1]; if(S-i>=n-S) { cout<<i<<endl; break; } } return 0; } |