Codeforces Round 113 (Div. 2)
C
Median
Codeforces
1500
原题
← BD →
翻译中…

A median in an array with the length of $*n*$ is an element which occupies position number image after we sort the elements in the non-decreasing order (the array elements are numbered starting with $1$). A median of an array $(2, 6, 1, 2, 3)$ is the number $2$, and a median of array $(0, 96, 17, 23)$ — the number $17$.

翻译中…

We define an expression image as the integer part of dividing number $*a*$ by number $*b*$.

翻译中…

One day Vasya showed Petya an array consisting of $*n*$ integers and suggested finding the array's median. Petya didn't even look at the array and said that it equals $*x*$. Petya is a very honest boy, so he decided to add several numbers to the given array so that the median of the resulting array would be equal to $*x*$.

翻译中…

Petya can add any integers from $1$ to $10^{5}$ to the array, including the same numbers. Of course, he can add nothing to the array. If a number is added multiple times, then we should consider it the number of times it occurs. It is not allowed to delete of change initial numbers of the array.

翻译中…

While Petya is busy distracting Vasya, your task is to find the minimum number of elements he will need.

翻译中…

Input

翻译中…

The first input line contains two space-separated integers $*n*$ and $*x*$ ($1 ≤ *n* ≤ 500$, $1 ≤ *x* ≤ 10^{5}$) — the initial array's length and the required median's value. The second line contains $*n*$ space-separated numbers — the initial array. The elements of the array are integers from $1$ to $10^{5}$. The array elements are not necessarily different.

翻译中…

Output

翻译中…

Print the only integer — the minimum number of elements Petya needs to add to the array so that its median equals $*x*$.

翻译中…

Note

翻译中…

In the first sample we can add number $9$ to array $(10, 20, 30)$. The resulting array $(9, 10, 20, 30)$ will have a median in position image, that is, $10$.

翻译中…

In the second sample you should add numbers $4$, $5$, $5$, $5$. The resulting array has median equal to $4$.

翻译中…

样例

Input #1
3 10
10 20 30
Output #1
1
InputCopy OutputCopy
Input #2
3 4
1 2 3
Output #2
4
InputCopy OutputCopy
题目信息
题号
166C
时间限制
2 s
内存限制
256 MB
标签
贪心
数学
排序

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