64,647
社区成员
发帖
与我相关
我的任务
分享
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
using namespace std;
int main()
{
int i, j, r;
int m, n;
int a[100], b[100], c[100];
cin >> m;
for (i = 0; i < m; i++) cin >> a[i];
sort(a, a + m);
cin >> n;
for (i = 0; i < n; i++) cin >> b[i];
sort(b, b + n);
i = j = r = 0;
while (i < m && j < n)
{
if (a[i] <= b[j]) c[r++] = a[i++];
else c[r++] = b[j++];
}
while (i < m) c[r++] = a[i++];
while (j < n) c[r++] = b[j++];
for (int i = 0; i < m + n; i++) cout << c[i] << " ";
cout << endl;
return 0;
}
//3
//2 1 5
//4
//23 45 1 25
//1 1 2 5 23 25 45