ZZULIOJ 1124: Merge two sorted arrays

1124: Merge two ordered arrays

span>Time limit: 1 Sec Memory limit: 128 MB

Title description

It is known that there are m elements in ascending order in array a, and n elements in descending order in array b. The programming stores all elements in a and b into array c in descending order.

Enter

The input has two lines, the first line is first a positive integer m, then m integers; the second line is first a positive integer n, then n integers, m, n are both less than or equal to 1000000.

Output

Output the combined m+n integers, separated by spaces.The output is on one line.

Sample input Copy

4 1 2 5 73 6 4 2

Sample output Copy

 7 6 5 4 2 2 1

#include #include int a[1000000];int b[1000000];int c[2000000];void merge(int*a,int m,int*b,int n);void print(int *c,int cnt);int cmp(const void*p1,const void*p2);//The overall idea is stored in a new array cint main(){int m,n;int i,j;scanf("%d",&m);for(i=0;ib[j]) c[k++]=a[i++];else c[k++]=b[j++];}while(i