Given two sorted lists (stored in arrays) of size n, find an O(log n)
algorithm that computes the nth largest element in the union of the two
lists.

UPDATE: 
1. Two arrays no need to be the same size n
2. Algorithm still has some problems with multiple negative values.