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 (≤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.
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
题目大意:
给定两个有序且不等长的数列,要求两个序列合并后的中位数。
思路:
中位数可能存在其中一列中,且有几种情形。如存在前一列,且后一列完全遍历完了。第二种是存在前一列但并没遍历完后一列。第三种存在后一列中且前一列何种情况都不管。只有其中一张会发生。
参考代码:
#include<cstdio>
int k[200006];
int n, m, temp, mid, i, cnt;
int main(){
scanf("%d", &n);
for(i = 1; i <= n; ++i)
scanf("%d", &k[i]);
k[n + 1] = 0x7fffffff;
scanf("%d", &m);
i = 1;
mid = (n + m + 1) / 2;
for(int j = 0; j < m; ++j){
scanf("%d", &temp);
while(k[i] < temp){
cnt++;
if(cnt == mid) printf("%d", k[i]);
i++;
}
cnt++;
if(cnt == mid) printf("%d", temp);
}
while(i <= n){
cnt++;
if(cnt == mid) printf("%d", k[i]);
i++;
}
return 0;
}
代码参考: