1029 Median （25 分）中位数

题目

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 ($\le 2\times 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： 申请两个数组，合并数据，然后直接做排序，直接得到中位数，当然，这种方法肯定是要超内存的。但我还是用这种方式皮了一下，想看看哪几个测试点数据量比较大……

/*
** @Brief:No.1029 of PAT advanced level.
** @Author:Jason.Lee
** @Date:2018-12-04 
** @status: wrong answer!
*/
#include<vector>
#