题解 | #有序序列合并#

//BC121 有序序列合并 
#include<stdio.h>
void S_arr(int arr[], int n, int m)
{
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]); 
	}
	for (int i = n; i < n + m; i++)
	{
		scanf("%d", &arr[i]); 
	}
}

void Bubbl_arr(int arr[], int n, int m)
{ 
	for (int i = 0; i < n + m ; i++) 
	{
		for (int j = 0; j < n + m - 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 arr[3000] = { 0 };  
	scanf("%d %d", &n, &m);

	S_arr(arr, n, m); 
	Bubbl_arr(arr, n, m);  
	Print_arr(arr, n, m); 

	return 0; 
}