优先队列解法

#include<bits/stdc++.h>
using namespace std;

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,m;
    cin>>n>>m;
    priority_queue<int,vector<int>,greater<int> > q;
    for(int i=1;i<=n;i++){
        int t;cin>>t;
        q.push(t);
    }
    for(int i=1;i<=m;i++){
        int t;cin>>t;
        q.push(t);
    }
    while(!q.empty()){
        cout<<q.top()<<" ";
        q.pop();
    }
	return 0;
}