CROC-MBTU 2012, Final Round (Online version, Div. 2)
C
Movie Critics
Codeforces
1600
原题
← BD →
翻译中…

A film festival is coming up in the city N. The festival will last for exactly $*n*$ days and each day will have a premiere of exactly one film. Each film has a genre — an integer from 1 to $*k*$.

翻译中…

On the $*i*$-th day the festival will show a movie of genre $*a*_{*i*}$. We know that a movie of each of $*k*$ genres occurs in the festival programme at least once. In other words, each integer from 1 to $*k*$ occurs in the sequence $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ at least once.

翻译中…

Valentine is a movie critic. He wants to watch some movies of the festival and then describe his impressions on his site.

翻译中…

As any creative person, Valentine is very susceptive. After he watched the movie of a certain genre, Valentine forms the mood he preserves until he watches the next movie. If the genre of the next movie is the same, it does not change Valentine's mood. If the genres are different, Valentine's mood changes according to the new genre and Valentine has a stress.

翻译中…

Valentine can't watch all $*n*$ movies, so he decided to exclude from his to-watch list movies of one of the genres. In other words, Valentine is going to choose exactly one of the $*k*$ genres and will skip all the movies of this genre. He is sure to visit other movies.

翻译中…

Valentine wants to choose such genre $*x*$ ($1 ≤ *x* ≤ *k*$), that the total number of after-movie stresses (after all movies of genre $*x*$ are excluded) were minimum.

翻译中…

Input

翻译中…

The first line of the input contains two integers $*n*$ and $*k*$ ($2 ≤ *k* ≤ *n* ≤ 10^{5}$), where $*n*$ is the number of movies and $*k*$ is the number of genres.

翻译中…

The second line of the input contains a sequence of $*n*$ positive integers $*a*_{1}$, $*a*_{2}$, ..., $*a*_{*n*}$ ($1 ≤ *a*_{*i*} ≤ *k*$), where $*a*_{*i*}$ is the genre of the $*i*$-th movie. It is guaranteed that each number from 1 to $*k*$ occurs at least once in this sequence.

翻译中…

Output

翻译中…

Print a single number — the number of the genre (from 1 to $*k*$) of the excluded films. If there are multiple answers, print the genre with the minimum number.

翻译中…

Note

翻译中…

In the first sample if we exclude the movies of the 1st genre, the genres $2, 3, 2, 3, 3, 3$ remain, that is 3 stresses; if we exclude the movies of the 2nd genre, the genres $1, 1, 3, 3, 3, 1, 1, 3$ remain, that is 3 stresses; if we exclude the movies of the 3rd genre the genres $1, 1, 2, 2, 1, 1$ remain, that is 2 stresses.

翻译中…

In the second sample whatever genre Valentine excludes, he will have exactly 3 stresses.

翻译中…

样例

Input #1
10 3
1 1 2 3 2 3 3 1 1 3
Output #1
3
InputCopy OutputCopy
Input #2
7 3
3 1 3 2 3 1 2
Output #2
1
InputCopy OutputCopy
题目信息
题号
250C
时间限制
2 s
内存限制
256 MB
标签
贪心

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。