#include<bits/stdc++.h> using namespace std; int a[1005]; int main(){ int n,maxn = -1; cin >> n; for(int i = 1;i <= n;i++){ int x; cin >> x; a[x]; maxn = max(maxn,x); } for(int i = 0;i <= maxn;i){ if(a[i] > ceil(n / 2)) cout << i; } return 0; }

[AC传送门](#include<iostream> using namespace std; int main(){ int n; cin>>n; int a[10005]; for(int i=0;i<n;i++){ cin>>a[i]; } for(int i=0;i<n;i++){ int m=0; for(int j=0;j<n;j++){ if(a[j]==a[i]){ m++; } } if(m>=n/2){ cout<<a[i]<<endl; break; } } return 0; })

传送门#include<iostream> using namespace std; int main(){ int n; cin>>n; int a[10005]; for(int i=0;i<n;i++){ cin>>a[i]; } for(int i=0;i<n;i++){ int m=0; for(int j=0;j<n;j++){ if(a[j]==a[i]){ m++; } } if(m>=n/2){ cout<<a[i]<<endl; break; } } return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ int n,a[1100000]; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++){ int sum=0; for(int j=1;j<=n;j++){ if(a[i]==a[j])sum++; } }

#include<bits/stdc++.h> using namespace std; int a[1000005]; int main(){ int n,x; cin>>n; for(int i=1;i<=n;i++){ cin>>x; a[x]; } int mx=a[1],s; for(int i=1;i<=1000;i){ if(mx<a[i]){ mx=a[i]; s=i; } } cout<<s; return 0; }

#include<cstdio> #include<iostream> #include<cmath> using namespace std; int n[114514],n1[114514]; int main(){ double a; cin>>a; for(int i=1;i<=a;i++){ cin>>n[i]; n1[n[i]]; } for(int i=0;i<114514;i){ if(n1[i]>a/2){ cout<<i; break; } } return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e6+1; int main(){ int n; cin>>n; int bucket[N]={0}; for(int i=0;i<n;i++){ int x; cin>>x; bucket[x]; } for(int i=0;i<N;i){ if(bucket[i]>n/2){ cout<<i; } } }

n = int(input()) nums = list(map(int, input().split())) candidate = None count = 0 for num in nums: if count == 0: candidate = num count = 1 elif num == candidate: count += 1 else: count -= 1 print(candidate)