【PAT】A1029 Median【中位数】

Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequences is defined to be the median of the nondecreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.

Given two increasing sequences of integers, you are asked to find their median.

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤2×10​5​​) is the size of that sequence. Then N integers follow, separated by a space. It is guaranteed that all the integers are in the range of long int.

Output Specification:

For each test case you should output the median of the two given sequences in a line.

Sample Input:

4 11 12 13 14
5 9 10 15 16 17

Sample Output:

13

题意

给出两个序列，求它们的中位数

思路

首先存储第一个序列，然后在线读取并存储第二个序列。使用一个指针指向第一个序列（初始时指向首位）一个计数器（计数当前遍历到从小到大第几个数），每读入第二个序列的一个元素，按如下处理：

• 如果该数比指针指向第一个序列的元素大，就将指针右移，计数器加1，直到不符合该条件。
• 否则计数器加1。
• 每次计数器加1时都判断一下是否找到中位数，是则返回中位数。

考虑奇数个元素的时候，中位数的序列大于N/2，所以中位数（设为mid）定义如下：从小到大第(n + m + 1) / 2个数（从1开始计数）。
如果上述操作完成后依然没有找到中位数，则中位数在第一个序列中上一个访问的元素的向右数（mid - count）个。

代码