1029. Median (25)

原创 2016年08月28日 16:21:38

1029. Median (25)

时间限制
1000 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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

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.

Output

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

#include<stdio.h>

int num[2][1000000];
int all[2000000];

int main(){
	int i, j, n1, n2, a;
	scanf("%d", &n1);
	for (i = 0; i < n1; i++)
		scanf("%d", &num[0][i]);
	scanf("%d", &n2);
	for (i = 0; i < n2; i++)
		scanf("%d", &num[1][i]);
	i = j = a = 0;
	while (i < n1 && j < n2){
		if (num[0][i] < num[1][j])
			all[a++] = num[0][i++];
		else
			all[a++] = num[1][j++];
	}
	while (i < n1)
		all[a++] = num[0][i++];
	while (j < n2)
		all[a++] = num[1][j++];

	printf("%d\n",all[(n1+n2-1)/2]);
	return 0;
}


胖客户端、瘦客户端和富客户端

1、胖客户端以C/S结构开发的网络应用程序,需要为客户端开发专用的客户端软件,相对而言其客户端比较庞大,在客户端可以实现很多功能,分担服务器的负担,属于胖客户端类型。  2、瘦客户端 以B/S结构开发...
  • cxwen78
  • cxwen78
  • 2011年05月06日 19:34
  • 1479

1212全民疯抢 欧时力专柜正品代购 短款羽绒服女1114331100

促销价格 : 249.0 元 掌柜 : 7公主1989 信用 : 30天累计售出 : 件 宝贝与描述相符 : 4.7低于0.58% 卖家的服务态度 : 4.7低于0.99% 卖家发货的速...
  • xp1204
  • xp1204
  • 2011年12月29日 08:34
  • 0

1029. Median (25)

题目要求 Given an increasing sequence S of N integers, the median is the number at the middle posit...
  • ysc6688
  • ysc6688
  • 2014年11月07日 21:11
  • 319

PAT (Advanced Level) 1029. Median (25) 求两个有序数组的中位数,二分

Given an increasing sequence S of N integers, the median is the number at the middle position. For e...

【C++】PAT(advanced level)1029. Median (25)

1029. Median (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Y...

1029. Median 解析

并归就好~~估计数据大 直接用scanf了 怕cin超时 #include #include #include using namespace std; vector l1; ...

Pat(Advanced Level)Practice--1029(Median)

Pat1029 代码 题目描述: Given an increasing sequence S of N integers, the median is the number at the mi...

PAT_1029: Median

Given an increasing sequence S of N integers, the median is the number at the middle position. For e...

GBT 1029-2005 三相同步电机试验方法

  • 2014年12月04日 13:56
  • 6.32MB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1029. Median (25)
举报原因:
原因补充:

(最多只允许输入30个字)