B. Reach Mediantime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a of n integers and an integer s. It is guaranteed that n is odd.In one operation you can either increase or decrease any single element by one. Calculate the minimum number of operations required to make the median of the array being equal to s.The median of the array with odd length is the value of the element which is located on the middle position after the array is sorted. For example, the median of the array 6, 5, 8 is equal to 6, since if we sort this array we will get 5, 6, 8, and 6 is located on the middle position.InputThe first line contains two integers n and s (1\le n\le 2\cdot 10^5-1, 1\le s\le 10^9) — the length of the array and the required value of median.The second line contains n integers a_1, a_2, \ldots, a_n (1\le a_i \le 10^9) — the elements of the array a.It is guaranteed that n is odd.OutputIn a single line output the minimum number of operations to make the median being equal to s.ExamplesInput3 86 5 8Output2Input7 2021 15 12 11 20 19 12Output6NoteIn the first sample, 6 can be increased twice. The array will transform to 8, 5, 8, which becomes 5, 8, 8 after sorting, hence the median is equal to 8.In the second sample, 19 can be increased once and 15 can be increased five times. The array will become equal to 21, 20, 12, 11, 20, 20, 12. If we sort this array we get 11, 12, 12, 20, 20, 20, 21, this way the median is 20.
Input3 86 5 8
Output2
['greedy', '*1300']