VJ_Finding Majority_map

//
#include<bits/stdc++.h>
using namespace std;

map< int,int > mp;
map< int,int >::iterator it;

int main()
{
	int n,x,i;
	
    while( ~scanf("%d",&n) )
    {
        mp.clear();
        for( i=0;i<n;i++ )
        {
            scanf("%d",&x); mp[x]++;
        }
        for( it=mp.begin();it!=mp.end();it++ )
        {
            if( it->second > n/2 ) break;
        }
        cout<<it->first<<endl;      // first
    }
    return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_63173957/article/details/124635430
vj