有序序列合并

#include
int main()
{
	int arr1[1000] = { 0 };
	int arr2[1000] = { 0 };
	int m, n;
	scanf("%d%d", &m, &n);
	for (int i = 0; i < m; i++)
	{
		scanf("%d", &arr1[i]);
	}

       for (int i = 0; i < n; i++)
{
	scanf("%d", &arr2[i]);
}
	   int i = 0;
	   int j = 0;
	   while (i < m && j < n)
	   {
		   if (arr1[i] < arr2[j])
		   {
			   printf("%d ", arr1[i]);
			   i++;
		   }

		   else  
	   {
		   printf("%d ", arr2[j]);
		   j++;
	   }
		  
}
	   while (i < m)
	   {
		   printf("%d ", arr1[i]);
		   i++;
	   }
	   while (j < n)
	   {
		   printf("%d ", arr2[j]);
		   j++;
	   }
	   return 0;
}