题解 | #整型数组合并#

#include<stdio.h> int cmp(const void* a, const void* b) { return ((int)a) - ((int)b);//升序排序 } int main() { int n, m; int arr[10000]; scanf("%d", &n); int arr1[n]; for (int i = 0; i < n; i++) { scanf("%d", &arr1[i]); arr[i] = arr1[i]; } scanf("%d", &m); int arr2[m]; for (int i = n; i < n + m; i++) { scanf("%d", &arr2[i]); arr[i] = arr2[i]; } qsort(arr, n + m, sizeof(int), cmp); for (int i = 0; i < n + m; i++) { if (arr[i] != arr[i + 1]) printf("%d", arr[i]); } return 0; }