csu1212: 中位数

给出两个长为n的升序序列S1和S2，求两序列合并并排序后的中位数。1 <= n <= 10 ^ 5

类似于merge sort的merge过程（可以省掉一个数组，边输入边计算）

// 1212
# include <stdio.h>
# define MAXN 100000
int a[MAXN+2],b[MAXN+2];
int main()
{
int n, i, j, k, cnt;
while (scanf("%d", &n)==1)
    {
        cnt = 0;
for (i=0;i<n;++i) scanf("%d",&a[i]);
for (i=0;i<n;++i) scanf("%d",&b[i]);
for (i=j=k=0;k<n-1;++k)
if(a[i]<b[j]) ++i;
else ++j;
        printf("%d\n", (a[i]<b[j] ? a[i]:b[j]));
    }
return 0;
}

转载于:https://www.cnblogs.com/JMDWQ/archive/2012/02/17/2356497.html