已有两个已排序（从小到大）的n个元素和m个元素的数组，将它们合并到一个从小到大的数组中

#include <stdio.h>

#include <stdlib.h>

int main()

{

        int a[100000];

        int b[100000];

        int c[200000];

        int m,n,s;

        scanf("%d",&m);

        for(s=0;s<m;s++)

        {

                 scanf("%d",&a[s]);

        }

        scanf("%d",&n);

        for(s=0;s<n;s++)

        {

                 scanf("%d",&b[s]);

        }

        int i=0,j=0,k=0;

        while(i<m && j<n)

        {

                 if(a[i]<=b[j])

                         {

                                  c[k++]=a[i++];

                         }

                 else

                         {

                                  c[k++]=b[j++];

                         }

        }

        for(j;j<n;j++)

                 {

                         c[k++]=b[j];

                 }

        for(i;i<m;i++)

                 {

                         c[k++]=a[i];

                 }

        for(i=0;i<m+n;i++)

    {

         printf("%d ",c[i]);

    }

    return 0;

       

 }