题解 | #有序序列合并#

using namespace std;
int main()
{
    int i, j, z;
    static int arr[31000] = { 0 };
    int n ,m;
    cin >> n >> m;
            //        输入
    for (i = 0; i < m+n; i++)
    {
        cin >> arr[i];
    }
            //        插入排序
            //        从n开始
    for (i = n; i < m+n; i++)
    {
        z = arr[i];
            //        从n-1向前比较
        for (j =i-1; j >=0; j--)
        {
            if (z < arr[j])
            {
                arr[j + 1] = arr[j];
            }
            else
            {
                arr[j + 1] = z;
                break;
            }
        }
        if (j < 0)
            arr[0] = z;
    }
    for (i = 0; i < n + m; i++)
        cout << arr[i] << ' ';
    cout << endl;
    system("pause");
    return 0;
}