Mode of Sequence
https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH27
1000ms 65536K
描述:
Given a sequence of N number. Find the mode M in the sequence so that the number of M's appear in the sequence is maximum.
给出一个有n个数的序列,找出对m的模最大的数在且序列离m最近
输入:
First line: one positive integers N (N <= 100).
Second line: N positive integers (<= 100000).
第一行:一个正整数表示n
第二行:n个正整数
输出:
One integer M.
一个数表示m
样例输入:
7 1 3 2 4 4 3 3
样例输出:
3