PAT甲级——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.

 

输入例子:

4 11 12 13 14
5 9 10 15 16 17

 

输出例子:

13

思路：

1. 本题不需要求得整合后的序列，只需要求出中位数即可。假设两个序列的长度为n、m，那么中位数所处的位置为（m+n-1）/2。
2. 用count从0开始计数，每次从S1[i]和S2[j]序列中选择最小值，count+1，直到count等于中位数的位置，然后判断此时S[i]和S[j]的大小，即为中位数的值。

   #include <iostream>
   using namespace std;
   const int maxn = 1000010;
   //const int INF = 0x7fffffff;
   const int INF =10000000;
   int S1[maxn], S2[maxn];
   
   int main()
   {
   	int n, m;
   	scanf("%d", &n);
   	for (int i = 0; i < n; i++)
   	{
   		scanf("%d", &S1[i]);
   	}
   	scanf("%d", &m);
   	for (int i = 0; i < m; i++)
   	{
   		scanf("%d", &S2[i]);
   	}
   	int median = (m + n - 1) / 2;
   	int i = 0, j = 0, count = 0;
   	while (count<median)
   	{
   		if (S1[i] < S2[j]) i++;
   		else j++;
   		count++;//这里要注意，实际上将序列整合排序后(S=sort（S1+S2)),count位置的数是接下来需要确定的数
   	}//当count=median时，这时是S[count]实际上并未确定是S1[i]或者是S2[i]
   	if (S1[i] < S2[j]) printf("%d", S1[i]);
   	else
   	{
   		printf("%d", S2[j]);
   	}
   	return 0;
   }

    

复习： 

       思路还是上面的思路，但是上面的代码有个重要的步骤漏掉了，所以有个测试点通不过。在选择两个序列的数的时候是比较序列头两个数的大小来选择的，有一种情况就是一个序列已经被遍历完了，但是还没有找到中位数，那么要在被遍完的序列后面设置一个int型的最大值防止访问的时候越界到后面的位置，所以必须在S1[n]，S2[m]置为INF，防止越界。

 

二刷代码：

#include <iostream>
using namespace std;
const int maxn = 1000000;
const int INF = 0x7fffffff;
int S1[maxn], S2[maxn];


int main()
{
	int n, m;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &S1[i]);
	}
	scanf("%d", &m);
	for (int i = 0; i < m; i++)
	{
		scanf("%d", &S2[i]);
	}

	int count = 0;
	int index = (n + m - 1) / 2;//向下取整
	S1[n] = INF, S2[m] = INF;//这里在两个序列后面都加上一个很大的数，防止一个序列读取完之后还没有找到中位数的情况
	int i = 0, j = 0;
	while (count<index)
	{
		if (S1[i] < S2[j])
			i++;
		else
			j++;
		count++;//count++是下一个要处理的数字
	}

	if (S1[i] < S2[j])
		printf("%d", S1[i]);
	else
		printf("%d", S2[j]);

	return 0;



}