Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1029. 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.


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 (<=1000000) 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.


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



#include <cstdio>

const int mx = 1000000 + 10;
long long a[mx], b[mx], c[2*mx], n1, n2;

int main()
	scanf("%d", &n1);
	for (int i = 0; i < n1; i++) scanf("%lld", a+i);
	scanf("%d", &n2);
	for (int i = 0; i < n2; i++) scanf("%lld", b+i);

	int i = 0, j = 0, k = 0;
	while (i < n1 && j < n2)
		if (a[i] < b[j]) c[k++] = a[i++];
		else c[k++] = b[j++];
	while (i < n1) c[k++] = a[i++];
	while (j < n2) c[k++] = b[j++];

	printf("%lld\n", c[(n1+n2-1)/2]);
上一篇: 下一篇: