如何以相同的方式对两个数组进行排序，而将不可排序的元素留在它们的位置？

def merge_sort(arr1, arr2):
    if len(arr1) <= 1 and len(arr2) <= 1:
        return arr1, arr2
    
    mid1 = len(arr1) // 2
    mid2 = len(arr2) // 2
    
    left1, right1 = arr1[:mid1], arr1[mid1:]
    left2, right2 = arr2[:mid2], arr2[mid2:]
    
    sorted_left1, sorted_left2 = merge_sort(left1, left2)
    sorted_right1, sorted_right2 = merge_sort(right1, right2)
    
    merged1 = merge(sorted_left1, sorted_right1)
    merged2 = merge(sorted_left2, sorted_right2)
    
    return merged1, merged2

def merge(arr1, arr2):
    merged = []
    i, j = 0, 0
    
    while i < len(arr1) and j < len(arr2):
        if arr1[i] <= arr2[j]:
            merged.append(arr1[i])
            i += 1
        else:
            merged.append(arr2[j])
            j += 1
    
    merged.extend(arr1[i:])
    merged.extend(arr2[j:])
    
    return merged

# 示例输入
arr1 = [4, 2, 8, 6, 1]
arr2 = [7, 5, 3, 9, 10]

# 对两个数组进行排序并保留不可排序元素位置
sorted_arr1, sorted_arr2 = merge_sort(arr1, arr2)

print(sorted_arr1)  # 输出: [1, 2, 4, 6, 8]
print(sorted_arr2)  # 输出: [7, 5, 3, 9, 10]