题解 | 有序序列合并

#include <stdio.h>


void scanf_arr(int arr1[], int n, int m)
{
	for (int i = 0; i < n + m; i++)
	{
		scanf("%d", &arr1[i]);
	}
}

void maopao_arr(int arr[], int n, int m)
{
	for (int i = 0; i < n + m - 1; i++)
	{
		for (int j = 0; j < n + m - i - 1; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				int tmp = arr[j]; 
				arr[j] = arr[j + 1]; 
				arr[j + 1] = tmp; 
			}
		}
	}
}

void print_arr(int arr[], int n, int m)
{
	for (int i = 0; i < n + m; i++)
	{
		printf("%d ", arr[i]);
	}
}

int main()
{
	int n = 0; 
	int m = 0; 
	int arr1[3000] = { 0 };
	scanf("%d %d", &n, &m); 
	scanf_arr(arr1, n, m);
	maopao_arr(arr1, n, m); 
	print_arr(arr1, n, m);
	return 0;
}