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.

제약 조건

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

예시

입력:
first = [1, 3]
second = [2]

예상 출력:
expected = 2.0

입력:
std::vector<long long> first = {1, 3};
std::vector<long long> second = {2};

예상 출력:
double expected = 2.0;

입력:
long[] first = new long[] {1, 3};
long[] second = new long[] {2};

예상 출력:
double expected = 2.0;

입력:
first = [1, 2]
second = [3, 4]

예상 출력:
expected = 2.5

입력:
std::vector<long long> first = {1, 2};
std::vector<long long> second = {3, 4};

예상 출력:
double expected = 2.5;

입력:
long[] first = new long[] {1, 2};
long[] second = new long[] {3, 4};

예상 출력:
double expected = 2.5;

참고 자료

이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.

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