合并有序表

//合并有序表
#include<bits/stdc++.h>
using namespace std;
#define Max 50
struct sqlist{
int a[Max];
int length;
};
//这里小心语法错误 就这样什么都不要赋值
bool merge(sqlist s,sqlist t,sqlist &p)
{
if(p.length<s.length+t.length)return false;
int i=0,j=0,k=0;
while(i<s.length&&j<t.length)
{
if(s.a[i]<t.a[j])p.a[k++]=s.a[i++];
else p.a[k++]=s.a[j++];}
while(i<s.length)p.a[k++]=s.a[i++];
while(j<t.length)p.a[k++]=t.a[j++];
return true;

}

int main()
{
sqlist s={{1,2,3,4,5},5};
sqlist t={{2,6,7,9},4};
sqlist p;
p.length=s.length+t.length;
merge(s,t,p);
for(int i=0;i<p.length;i++)cout<<p.a[i]<<" ";

}