백준 소스코드 [C++] 11728 배열 합치기

www.acmicpc.net/problem/11728

11728번: 배열 합치기

백준 소스코드 [C++] 11728 배열 합치기

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#include <set>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
#define make_unique(v) v.erase(unique(v.begin(), v.end()), v.end())
typedef long long ll;
using namespace std;

int n, m;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m;
	vector<int> v,w;
	v.resize(n);
	w.resize(m);
	for (int i = 0;i < n;i++) cin >> v[i];
	for (int i = 0;i < m;i++) cin >> w[i];
	int V = 0, W = 0;

	while(V<n && W<m){
		if (v[V] <= w[W]) cout << v[V++] << " ";
		else cout << w[W++] << " ";
	}
	if (V == n) while(W<m)cout << w[W++] << " "; 
	else while (V < n)cout << v[V++] << " ";
	return 0;
}