HDU 1029 Ignatius and the Princess IV

题目：点击打开链接

代码：

#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;int a[1000000];int b[1000000];int main(){   int n;   while(~scanf("%d",&n))   {       memset(b,0,sizeof(b));      for(int i=0;i<n;i++)      {          scanf("%d",&a[i]);          b[a[i]]++;      }      for(int i=0;i<n;i++)      {          if(b[a[i]]>=(n+1)/2)          {printf("%d\n",a[i]);break;}      }   }}