题解 | 有序序列合并 指针比较排序

#include <stdio.h>
#include<stdlib.h>
int main(){
    int n, m;
    scanf("%d %d", &n, &m);
    int*a1=(int*)malloc(n*sizeof(int));
     int*a2=(int*)malloc(m*sizeof(int));
     int *result = (int*)malloc((n + m) * sizeof(int));
for (int i = 0; i < n; i++) 
        scanf("%d", &a1[i]); 
        for (int i = 0; i <m; i++) 
        scanf("%d", &a2[i]); 
         int *p1 = a1, *p2 = a2, *p = result;
while(p1<a1+n&&p2<a2+m)
    *p++=(*p1<*p2)?*p1++:*p2++;
while(p1<a1+n) *p++=*p1++;
while (p2 < a2 + m)  *p++ = *p2++; 
 for (int i = 0; i < n + m; i++) 
        printf("%d ", result[i]);
 }