题解 | #有序序列合并#
有序序列合并
https://www.nowcoder.com/practice/a9e943b0dab142759807d0cfb6863897
#include <stdio.h> int main() { int n = 0; int m = 0; scanf("%d %d", &n, &m);// 2 2 int arr[2000] = { 0 }; int i = 0; for (i = 0; i < n + m; i++)//2 4 1 9 { scanf("%d", &arr[i]); } for (i = 0; i < n + m - 1; i++)//3 { int j = 0; int ret = 0; for(j = 0; j < n + m - 1 - i; j++) { if (arr[j] > arr[j + 1]) { ret = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = ret; } } } for (i = 0; i < n + m; i++) { printf("%d ", arr[i]); } return 0; }