给定k 个排好序的序列s , s , , sk 1 2  , 用 2 路合并算法将这k 个序列合并成一个序列。

假设所采用的 2 路合并算法合并 2 个长度分别为m和n的序列需要m + n -1次比较。试设

计一个算法确定合并这个序列的最优合并顺序，使所需的总比较次数最少-Given k sorted sequence s, s, sk 1 2 　2-way merge algorithm these the k sequences merged into a single sequence. The assumptions used in 2-way merge algorithm combined length of 2 m+ n-1 comparisons need for the sequence of m and n, respectively. Try to design an algorithm to determine the optimal merge order to merge the sequence, so that the total number of comparisons required at least