#include
     
      #include
      
       #include
       
        #include
        
         #define maxn 1010using namespace std;void merge(int sr[],int tr[],int i,int m,int n){/* 将有序的sr[i..m]和sr[m+1..n]归并为有序的tr[i..n] */    int j,k,l;    for(j=m+1,k=i;i<=m&&j<=n;k++)/* 将sr中记录由小到大地并入tr */    {        if(sr[i]
         
          > n;    int a[n];    memset(a,0,sizeof(a));    for(int i=1;i<=n;i++)        cin >> a[i];    msort(a,a,1,n);    for(int i=1;i<=n;i++)        cout << a[i] << endl;    return 0;}/*过程图见大话数据结构408-412*/