题解 | #有序序列合并#

#include <stdio.h>

int main()
{
	int arr1[1000] = { 0 };
	int arr2[1000] = { 0 };
	int arr3[1000] = { 0 };
	int n, m;
	scanf("%d %d", &n, &m);
	int i = 0;
	for (i = 0; i < n; i++)
	{
		 scanf("%d", &arr1[i]);
		 arr3[i] = arr1[i];
	}
	int j = 0;
	for (j = 0; j < m; j++)
	{
		scanf("%d", &arr2[j]);
		arr3[i++] = arr2[j];
	}
	int k = 0;
	int q = 0;
	int t = 0;
	for (k = 0; k < n + m-1; k++)
	{
		
		for (q = k+1; q < n + m; q++)
		{
			if (arr3[k]>arr3[q])
			{
				t = arr3[k];
				arr3[k] = arr3[q];
				arr3[q] = t;
			}
				
		}
		
	}
	for (k = 0; k < n + m; k++)
	{
		printf("%d ", arr3[k]);
	}
	return 0;
}