考察合并序列的中位数
#include<vector>
#include<iostream>
int main()
{
int n1, n2;
while(scanf("%d",&n1)!=EOF)
{
std::vector<int> a, b;
for(int i = 0; i < n1; ++i)
{
int tmp;
scanf("%d",&tmp);
a.push_back(tmp);
}
scanf("%d",&n2);
for(int i = 0; i < n2; ++i)
{
int tmp;
scanf("%d",&tmp);
b.push_back(tmp);
}
//find median
int aIdx, bIdx, k;
aIdx = bIdx = 0;
int mIdx = (n1+n2-1)/2;
int cur;
for( k = -1; aIdx < n1 && bIdx < n2; )
{
if(a[aIdx] <= b[bIdx])
{
cur = a[aIdx];
++aIdx;
++k;
}
else
{
cur = b[bIdx];
++bIdx;
++k;
}
if(k == mIdx)
{
printf("%d\n",cur);
break;
}
}
if(k != mIdx && aIdx < n1)
printf("%d\n", a[aIdx+mIdx-k-1]);
if(k != mIdx && bIdx < n2)
printf("%d\n", b[bIdx+mIdx-k-1]);
}
return 0;
}