题号:NC25070
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 32 M,其他语言64 M
64bit IO Format: %lld
题目描述
Like many, Bessie is concerned with popularity. In some things, she wants to be just like all the other cows.
She has tabulated a sorted list of the number of ounces of milk (1 <= ounces <= 10,000) that each of the N (2 <= N <= 20,000) cows gives each day. She wants to know which number appears most often in the list and is just positive that the number is unique.
输入描述:
Line 1: A single integer: N
Lines 2..N+1: Line i contains a single integer that is the ounces of milk given by cow i.
输出描述:
Line 1: The number that appears most often in the input list
示例1
说明
Five cows, each giving 512-599 ounces of milk.
532 appears twice; the other numbers appear but once