-
Notifications
You must be signed in to change notification settings - Fork 0
/
merge.c
50 lines (46 loc) · 1.15 KB
/
merge.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include<stdio.h>
#include <stdlib.h>
int a, b;
void solve(int *c, int *d, int *merge) {
int cnt1 = 0, cnt2 = 0, index = 0;
while(cnt1 < a || cnt2 < b) {
if(c[cnt1] < d[cnt2] && cnt1 < a) {
merge[index] = c[cnt1];
index++;
cnt1++;
}
else if(c[cnt1] >= d[cnt2] && cnt2 < b) {
merge[index] = d[cnt2];
index++;
cnt2++;
}
else if(cnt1 == a) {
merge[index] = d[cnt2];
cnt2++;
index++;
}
else if(cnt2 == b){
merge[index] = c[cnt1];
cnt1++;
index++;
}
}
}
int main() {
scanf("%d %d", &a, &b);
int *A, *B, *merge;
A = (int*)malloc(a * sizeof(int));
B = (int*)malloc(b * sizeof(int));
merge = (int*)malloc((a + b) * sizeof(int));
for(int i = 0; i < a; i++)
scanf("%d", &A[i]);
for(int i = 0; i < b; i++)
scanf("%d", &B[i]);
solve(A, B, merge);
for(int i = 0; i < (a + b); i++) {
printf("%d", merge[i]);
if(i < (a + b - 1)) printf(" ");
else printf("\n");
}
return 0;
}