maintain a deque of candidates idx in decreasing order only from the current sliding window

use to balanced heaps, one for highest from small and second for lowest among large number.

use two-pointer technique, calculate Area = width * height

heapq library to obtain the kth largest number in O(n * log(k * m)) time.