Merging of Shanzhai version [i]

subject ：

Title Description

Problem description

Coco and LeLe have a lot of game cards on hand , There are numbers on the cards , They sort their cards from small to large , Now they want to put their cards together , And also ensure that it is sorted from small to large . Because the number of cards may reach millions , And you have to merge the cards in a second , Now please help ！

Input format

There are three lines .

first line ： Two integers separated by spaces n and m, Number of cards representing cocoa and LeLe respectively ;

The second line ：n An integer separated by a space , Indicates the number of cocoa cards from small to large ;

The third line ：m An integer separated by a space , Indicates the number of Lele card from small to large ;

Output format

Just one line ：n+m It's an integer , Space off , Indicates the number of the combined card from small to large .

sample input

3 4

3 5 7

1 3 4 6

sample output

1 3 3 4 5 6 7

Data range

n<=1000000,m<=1000000

The time set by the teacher for the beginning of this problem is 2 Sec, Ha ha ha , Violence directly 100 To get ：
Definition a[2000010]
Then go straight to various individual sort Violent perfection .

But the teacher saw us operate so N, I changed the time to 1 Sec.

wawawaw, Suddenly tears poured down .

…

shua Code start
Got two “ The pointer ”（ It's not here *x The pointer of ）.
i,j;
Don't talk much , Code up ：

#include <bits/stdc++.h>
 
using namespace std;
 
int a[1000010],b[1000010];
 
int main(){
    
 
 
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int j=1;j<=m;j++)scanf("%d",&b[j]);
    int i=1,j=1;
    for(int x=1;x<=n+m;x++){
    
        if(a[i]>b[j])printf("%d ",a[i]),i++;
        else printf("%d ",b[j]),j++;
    }
 
 
    return 0;
}

goodbye!!!
Shanzhai version merged 【 Next 】 Portal