已知有两个等长的非降序序列S1, S2, 设计函数求S1与S2并集的中位数。有序序列,的中位数指A(N−1)/2的值,即第⌊个数(A0为第1个数)。
输入格式:
输入分三行。第一行给出序列的公共长度N(0<N≤100000),随后每行输入一个序列的信息,即N个非降序排列的整数。数字用空格间隔。
输出格式:
在一行中输出两个输入序列的并集序列的中位数。
输入样例1:
5
1 3 5 7 9
2 3 4 5 6
输出样例1:
4
输入样例2:
6
-100 -10 1 1 1 1
-50 0 2 3 4 5
输出样例2:
1
#include<bits/stdc++.h>
#define OK 1
#define ERROR 0
using namespace std;
typedef int Status;
typedef int ElemType;
typedef struct LNode *List;
typedef struct LNode
{
ElemType data;
struct LNode *next;
} LNode, *LinkList;
Status InitList(LinkList &L)
{
L = new LNode;
L -> next = NULL;
return OK;
}
void CreateList(LinkList &L, int N)
{
L = new LNode;
L -> next = NULL;
LNode *p,*q;
p = L;
q = new LNode;
ElemType tmp;
for(int i = 0; i<N; i++)
{
cin>>tmp;
q = new LNode;
q -> data = tmp;
q -> next = NULL;
p -> next = q;
p = q;
}
}
void MergeList(LinkList &LA, LinkList &LB, int data[])
{
int i = 0;
LNode *pa,*pb;
pa = LA -> next;
pb = LB -> next;
while(pa&&pb)
{
if(pa -> data < pb -> data)
{
data[i ++] = pa -> data;
pa = pa -> next;
}
else
{
data[i ++] = pb -> data;
pb = pb -> next;
}
}
while(pa)
{
data[i ++] = pa -> data;
pa = pa -> next;
}
while(pb)
{
data[i ++] = pb -> data;
pb = pb -> next;
}
delete LB;
}
int main()
{
int N;
cin>>N;
LinkList LA,LB;
InitList(LA);
InitList(LB);
CreateList(LA, N);
CreateList(LB,N);
int data[N*2];
MergeList(LA,LB,data);
cout<<data[N - 1];
}