39번 정렬알고리즘

#include<iostream>
#include<vector>
using namespace std;

int main(void)
{
	int N = 0;
	int M = 0;
	cin >> N;
	int arr[200];
	for (int i = 0; i < N; i++)
	{
		cin >> arr[i];
	}
	cin >> M;
	int sum = N + M;
	for (int i = N; i < sum; i++)
	{
		cin >> arr[i];
	}

	

	int j = 0;
	int tmp = 0;
	for (int i = 1; i < sum; i++)
	{
		tmp = arr[i];
		for (j = i - 1; j >= 0; j--)
		{
			if (arr[j] > tmp)
			{
				arr[j + 1] = arr[j];
			}
			else break;
		}
		arr[j+1] = tmp;
	}

	for (int i = 0; i < sum; i++)
	{
		cout << arr[i];
	}
}