题解 | #有序序列合并#

#include<stdio.h>
#include <stdlib.h>

int main()
{
	int n, m;
	scanf("%d %d",&n,&m);
	int* pmn = (int*)malloc(sizeof(int) * n*m);
	int i;
	for (i = 0; i < n; i++)
		scanf("%d",&pmn[i]);
	for (; i < m+n; i++)
		scanf("%d", &pmn[i]);
	for (i = 0; i < n + m - 1; i++)
	{
		int j;
		int temp;
		for (j = 0; j < n + m - 1 - i; j++)
		{
			if (pmn[j] > pmn[j + 1])
			{
				temp = pmn[j];
				pmn[j] = pmn[j + 1];
				pmn[j + 1] = temp;
			}

		}

	}
	for (i = 0; i < m + n; i++)
		printf("%d ",pmn[i]);
	free(pmn);
	return 0;

}