题目描述
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 ( ≤ 2 × 1 0 5 ≤2×10^5 ≤2×105) 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.
思路
就是两个排序好的数组选一个中间的数字。一个循环每一次遍历后判断a[i]和b[j]选一个较小的,直到找到最中间的那个即可。注意一开始给a,b数组弄成最大值。
代码
#include<iostream>
#include<cstdio>
#include<stdlib.h>
#include<string>
using namespace std;
long a[200010];
long b[200010];
int main()
{
int n1, n2;
cin >> n1;
for (int i = 0; i < 200010; i++)
{
a[i] = b[i] = 0x7fffffff;
}
for (int i = 0; i < n1; i++)
{
cin >> a[i];
}
cin >> n2;
for (int i = 0; i < n2; i++)
{
cin >> b[i];
}
int len = (n1 + n2 + 1) / 2;
int number = 0;
int i = 0;
int j = 0;
while (1)
{
long cur;
if (a[i] < b[j])
{
cur = a[i];
i++;
number++;
}
else
{
cur = b[j];
j++;
number++;
}
if (number == len)
{
printf("%ld\n", cur);
break;
}
}
}