Meet In The Median

You're given a sequence of $N$ **distinct** integers. You need to find a subsequence of length $K$ with the maximum possible median. The median of a sequence is the value of the element which is in the middle of the sequence after sorting it in non-decreasing order. If the length of the sequence is even, the left of two middle elements is selected. For example, if the sequence is $[3, 4, 2, 1, 5]