数组合并

```java
import java.util.Scanner;

public class shuzuhebing {
	public static int[] Merge(int sr[],int s,int m,int t) {
		int i=s,j=m+1,k=s;
		int tr[]=new int[t+1];
		while(i<=m&&j<=t) {
			if(sr[i]<sr[j])
				tr[k++]=sr[i++];
			else
				tr[k++]=sr[j++];
		}
		while(i<=m) {tr[k++]=sr[i++];}
		while(j<=t) {tr[k++]=sr[j++];}
		return tr;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
while(sc.hasNext()) {
	int n1=sc.nextInt();
	int a1[]=new int[n1];
	for(int i=0;i<n1;i++) {a1[i]=sc.nextInt();}
	int n2=sc.nextInt();
	int sr[]=new int[n1+n2];
	int tr[]=new int[n1+n2];
	int a2[]=new int[n2];
	int t=n1;
	for(int i=0;i<n2;i++) {a2[i]=sc.nextInt();}
	
	for(int i=0;i<n1;i++) {sr[i]=a1[i];}
	for(int i=0;i<n2;i++) {sr[t++]=a2[i];}
	tr=Merge(sr,0,n1-1,n1+n2-1);
	for(int i=0;i<n1+n2;i++) {
	System.out.print(tr[i]+" ");}
	System.out.println("\n");//输出之间空一行
	/*int n2=sc.nextInt();
	int a2[]=new int[n2];
	for(int i=0;i<n2;i++) {a2[i]=sc.nextInt();}
	int t=n1+n2;
	int a[]=new int[t];
	for(int i=0;i<t;i++) {}*/
	
	
	
	
}
	}

}