#include<stdlib.h>
void just(int ret[], int arr[], int arr1[],int x,int y)
{
int i,j;
for (i = 0; i <=x; i++)
{
ret[i] = arr[i];
}
for (j = 0; j<= y; j++)
{
ret[i+ j] = arr1[j];
}
}
void just1(int* ret, int n)
{
int i = 0,j;
for (i = 0; i < n - 1; i++)
{
for (j = 0; j < n - i - 1; j++)
{
if (ret[j] > ret[j + 1])
{
int tmp = ret[j + 1];
ret[j + 1] = ret[j];
ret[j] = tmp;
}
}
}
}
int main()
{
int arr[100];
int arr1[100];
int i = 0, j = 0;
while (1) {//初始化数组arr
scanf("%d", &arr[i]);
if (getchar() == '\n')
break;
i++;
}
while (1) {//初始化数组arr1
scanf("%d", &arr1[j]);
if (getchar() == '\n')
break;
j++;
}
int k = i + j + 2;//记录元素个数
int* ret = (int*)malloc(sizeof(int) * k);//开辟大小为k个元素的数组
just(ret, arr, arr1, i, j);//将数组arr和arr1中的元素放置在ret中
just1(ret, k);//对ret数组进行排序
for (i = 0; i < k; i++)
{
printf("%d ", ret[i]);
}
free(ret);
return 0;
}