2022.05.16

39. 병합정렬

#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main(){

	//freopen("input.txt","rt",stdin);
	
	int n;
	cin>>n;
	
	vector<int> a;
	int num;
	for(int i=0; i<n; i++){
		cin>>num;
		a.push_back(num);
	}
	a.push_back(INT_MAX);
	
	cin>>n;
	vector<int> b;
	for(int i=0; i<n; i++){
		cin>>num;
		b.push_back(num);
	}
	b.push_back(INT_MAX);

	int j=0;
	int k=0;
	vector<int> answer;
	for(int i=0; i<a.size()+b.size()-2; i++){
		if(a[j]<=b[k]){
			answer.push_back(a[j++]);
			
		}
		else if(b[k]<a[j]){
			answer.push_back(b[k++]);
		}
	}
	
	for(int o: answer)
		cout<<o<<' ';
		
	return 0;
	
}