MAJORITY  Finding Majority
Given an array A of N integers in wich the most frequent item appear most than n / 2 times,
calculate this value.
Input
The first line contain N (1 <= N <= 3000000) then N 32bit integers per line.
Output
The output consists of one number: the most frequent item on A.
Example
Input: 5
2
3
2
2
4 Output: 2
hide comments
sdfghjgr:
20171104 12:04:51
Time limits are not strict enough. My nlogn solution was accepted :( 

:):
20120720 14:44:37
hey its a tutorial!!! 

eddy:
20120720 03:12:33
must be moved to the tutorial! 

Francky:
20120720 03:12:33
There's a typo in first line with 'N' and 'n'.


Sidharth Gupta:
20120720 03:12:33
tutorial! 

devu:
20120720 03:12:33
move it to tutorials 
Added by:  Frank Rafael Arteaga 
Date:  20120719 
Time limit:  0.100s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Classic problem 