题解 | #有序序列合并#
有序序列合并
https://www.nowcoder.com/practice/a9e943b0dab142759807d0cfb6863897
#include <stdio.h>
int main() {
int a, b;
int arr1[10000] = {0};
int temp = 0;
scanf("%d",&a);
scanf("%d",&b);
for (int i = 0; i < a + b; i++) {
scanf("%d",&arr1[i]);
}
for (int i = 0; i < a + b; i++) {
for (int j = i+1; j < a + b;j++) {
if (arr1[j] > arr1[i]) {
int temp = arr1[i];
arr1[i] = arr1[j];
arr1[j] = temp;
}
}
}
for (int i = a + b - 1; i >= 0; i--) {
printf("%d ",arr1[i]);
}
return 0;
}
