题解 | #链表的合并#

#include<iostream>
#include<algorithm>
#include<set>
using namespace std;

int main() {
	multiset<int> s;
	int arr1[15], arr2[15];
	
	for (int i = 0; i < 15; i++) { 
		cin >> arr1[i];
		s.insert(arr1[i]);
	}//链表1
	for (int i = 0; i < 15; i++) { 
		cin >> arr2[i];
		s.insert(arr2[i]);
	}//链表2

	for (multiset<int>::iterator it = s.begin(); it != s.end(); it++) {
		cout << *it << " ";
	}//遍历multiset容器
	
	return 0;
}