给定k 个排好序的序列s1 , s2,……, sk , 用2 路合并算法将这k 个序列合并成一个序列。。C语言

可以使用归并排序的思想进行2路合并，具体实现可以参考以下代码：

#include <stdio.h>

void merge(int a[], int b[], int c[], int m, int n) {
int i = 0, j = 0, k = 0;
while (i < m && j < n) {
if (a[i] < b[j])
c[k++] = a[i++];
else
c[k++] = b[j++];
}
while (i < m)
c[k++] = a[i++];
while (j < n)
c[k++] = b[j++];
}

void mergeK(int arr[][100], int k, int result[], int size) {
int i, j;
int *temp = new int[size];
for (i = 0; i < size; i++)
temp[i] = arr[0][i];
for (i = 1; i < k; i++) {
merge(temp, arr[i], result, size, size);
for (j = 0; j < size; j++)
temp[j] = result[j];
}
delete[] temp;
}

int main() {
int arr[3][100] = {{1, 4, 7}, {2, 5, 8}, {3, 6, 9}};
int result[9];
mergeK(arr, 3, result, 3);
for (int i = 0; i < 9; i++)
printf("%d ", result[i]);
printf("\n");
return 0;
}