题解 | 有序序列合并

#include <stdio.h>



int main()
{
	int n, m = 0;
	int arr1[2000] = { 0 }; 
	scanf("%d %d", &n, &m);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr1[i]);
	}
	for (int j = n; j < n + m; j++)
	{
		scanf("%d", &arr1[j]);
	}
	for (int i = 0; i < n + m; i++)
	{
		for (int j = 0; j < n + m - i - 1; j++)
		{
			if (arr1[j] > arr1[j + 1])
			{
				int tmp = arr1[j]; 
				arr1[j] = arr1[j + 1]; 
				arr1[j + 1] = tmp;
			}
		}
	}
	for (int i = 0; i < n + m; i++)
	{
		printf("%d ", arr1[i]); 
	}
	return 0; 
}