Binary search for leftmost index i in sorted array such that arr[i] == minimum threshold. Call that index j. Then find median of arr[j...end] in constant time, accounting for whether size of subarray is even or odd. Accounted for edge cases when minimum threshold is less than arr[0] or greater than arr[end]. Accounted for duplicates.