MAJOR - Majority
The human tribe has just discovered some other tribe and wants to communicate with them. To make sure it is not intercepted by the terminators, they ask their chief computer engineer Rohit to design a system for the purpose. In the design that Rohit proposes, data is transmitted n times. If it is received more than half-the times, it is said to be successfully transmitted. If not, the data is said to be lost. Rohit obviously got a lot of fame and respect for his work. Nitish doesn’t like it and wants to challenge Rohit’s supremacy. He wants to check out the system and has hired you for the process.
Input
The first line of the input contains test cases t (1 <= t <= 100). It is followed by 2*t lines, 2 for each test case. The first line of input for each test case contains a number n (0 <= n <= 106), followed by n elements in the next line. Each number is from -10^3 to +10^3
Output
You are required to output ‘YES’ followed by the number transmitted, if it was transmitted successfully, and ‘NO’ otherwise.
Example
Input: 3 4 2 1 2 2 6 1 1 1 2 2 2 5 1 2 4 5 1 Output: YES 2 NO NO
hide comments
codeappy:
2017-03-15 14:45:38
use map or array.
|
|
nilabja16180:
2017-03-03 16:02:26
AC in ONE GO!
|
|
amalik123:
2017-02-16 14:43:56
Ac in one go ,map rocks......... |
|
cake_is_a_lie:
2017-02-15 07:31:43
More people should pay attention to the restrictions when choosing an algorithm to implement. |
|
sonudoo:
2017-02-05 15:46:59
As usual, time limit has been harsh on Python |
|
vengatesh15:
2017-01-23 18:53:02
tutorial one... |
|
sachinsharma12:
2017-01-21 10:28:35
Nice prblm
|
|
vunnamtej:
2017-01-13 09:01:00
O(n) moore's voting algorithm
|
|
swatantragupta:
2016-12-24 10:39:22
learnt something new..:)
|
|
codesok:
2016-12-16 18:34:11
Simple O(n) with just an array |
Added by: | Troika::Bytes |
Date: | 2010-02-18 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: PERL6 |