DMOPC '19 Contest 3 P1 - Mode Finding

View as PDF

Submit solution

Points: 5
Time limit: 2.0s
Memory limit: 256M

Author:
Problem type

You are given N numbers, a_1, a_2, \ldots , a_N. Output all the modes of this list on a single line from least to greatest. The mode of a list is/are the value(s) that appear(s) the most times relative to the other values in the list. It is guaranteed that at least one mode exists.

Constraints

In all tests,
1 \le N \le 10^6
-10^5 \le a_i \le 10^5

Input Specifications

The first line contains one number, N.
The second line contains N spaced integers, a_i, the numbers in this list.

Output Specifications

On one line, output the modes of the N numbers in increasing order.

Sample Input

10
9 2 9 6 8 7 1 3 9 6

Sample Output

9

Comments


  • -6
    Narcariel  commented on Feb. 21, 2020, 3:41 p.m.

    This comment is hidden due to too much negative feedback. Click here to view it.


  • -6
    mrmackamoo  commented on Feb. 4, 2020, 11:32 p.m. edit 3

    This comment is hidden due to too much negative feedback. Click here to view it.


    • 1
      Super_User  commented on Feb. 8, 2020, 3:50 p.m. edited

      9 2 9 6 8 7 1 3 9 6

      1: 1 occurrence

      2: 1 occurrence

      3: 1 occurrence

      4: 0 occurrences

      5: 0 occurrences

      6: 2 occurrences

      7: 1 occurrence

      8: 1 occurrence

      9: 3 occurrences

      Therefore, 9 is the mode.


    • -4
      YaySushi  commented on Feb. 4, 2020, 11:43 p.m.

      yoh :D