Median of Two Sorted Arrays

Both lists are sorted in ascending order. Find the median of all their numbers together; for an even count it is the average of the two middle values. An O(log(m + n)) partition search is possible, but any correct method within the limits is accepted.

Implement median_of_two(first, second).

Input

first: A sorted list. second: A sorted list.

Output

Return the median.

Contraintes

0 ≤ lengths ≤ 100,000; the combined length is at least 1

Exemples

Entrée :
first = [1, 3]
second = [2]

Sortie attendue :
expected = 2.0

Entrée :
std::vector<long long> first = {1, 3};
std::vector<long long> second = {2};

Sortie attendue :
double expected = 2.0;

Entrée :
long[] first = new long[] {1, 3};
long[] second = new long[] {2};

Sortie attendue :
double expected = 2.0;

Entrée :
first = [1, 2]
second = [3, 4]

Sortie attendue :
expected = 2.5

Entrée :
std::vector<long long> first = {1, 2};
std::vector<long long> second = {3, 4};

Sortie attendue :
double expected = 2.5;

Entrée :
long[] first = new long[] {1, 2};
long[] second = new long[] {3, 4};

Sortie attendue :
double expected = 2.5;

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• From Problems to Performance: Two Decades of Programming Contests in the CCSC Southeast