[恢]hdu 1412

2011-12-20 14:46:51

地址：http://acm.hdu.edu.cn/showproblem.php?pid=1412

题意：中文。

代码：

# include <stdio.h>
# include <stdlib.h>


int a[10010], b[10010], c[20010] ;


int cmp(const void *a, const void *b)
{
    return *(int*)a - *(int*)b ;
}


int main ()
{
    int n, m, cnt, i, j ;
    while (~scanf ("%d%d", &n, &m))
    {
        for (i = 0 ; i < n ; i++)
            scanf ("%d", &a[i]) ;
        for (i = 0 ; i < m  ; i++)
            scanf ("%d", &b[i]) ;
        qsort (a, n, 4, cmp) ;
        qsort (b, n, 4, cmp) ;
        i = j = cnt = 0 ;
        while (i < n && j < m)
        {
            if (a[i] < b[j])
                c[cnt++] = a[i++] ;
            else if (a[i] > b[j])
                c[cnt++] = b[j++] ;
            else
            {
                c[cnt++] = a[i] ;
                i++, j++ ;
            }
        }
        while (i<n) c[cnt++] = a[i++] ;
        while (j<m) c[cnt++] = b[j++] ;
        for (i = 0 ; i < cnt ; i++)
        {
            if (i == 0) printf ("%d", c[i]) ;
            else printf (" %d", c[i]) ;
        }
        printf ("\n") ;
    }
    return 0 ;
}