牛客62689606...：这样有没有利用原本序列有序的特点#include <stdio.h> void merge_sorted_arrays(int* arr1,int n,int* arr2,int m,int* merged_sorted_arr) { int i = 0; int j = 0; int k = 0; while (i < n && j < m) { if (arr1[i] < arr2[j]) merged_sorted_arr[k++] = arr1[i++]; else merged_sorted_arr[k++] = arr2[j++]; } while (i < n) { merged_sorted_arr[k++] = arr1[i++]; } while (j < m) { merged_sorted_arr[k++] = arr2[j++]; } } int main() { int n = 0; int m = 0; scanf("%d %d", &n, &m); int arr1[n] ; int arr2[m] ; int merged_sorted_arr[n + m] ; int i = 0; for (i = 0; i < n; i++) { scanf("%d", &arr1[i]); } for (i = 0; i < m; i++) { scanf("%d", &arr2[i]); } merge_sorted_arrays(arr1, n, arr2, m,merged_sorted_arr); for (i = 0; i < n + m; i++) { printf("%d ", merged_sorted_arr[i]); } return 0; }</stdio.h>