Advertisement
Guest User

Untitled

a guest
Oct 19th, 2019
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.59 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. int a[100002], b[100002], c[200004];
  4.  
  5. int main() {
  6. int n, i, m, j, an, bm, cn;
  7. scanf("%d %d", &n, &m);
  8. for (i = 1; i <= n; ++i)
  9. scanf("%d", &a[i]);
  10. for (i = 1; i <= m; ++i)
  11. scanf("%d", &b[i]);
  12. an = 1; bm = 1; cn = 1;
  13. while(an <= n && bm <= m) {
  14. if(a[an] < b[bm]) {
  15. c[cn] = a[an];
  16. cn++;
  17. an++;
  18. }
  19. else {
  20. c[cn] = b[bm];
  21. cn++;
  22. bm++;
  23. }
  24. }
  25. for(i = an; i <= n; ++i) {
  26. c[cn] = a[i];
  27. cn++;
  28. }
  29. for(i = bm; i <= m; ++i) {
  30. c[cn] = b[i];
  31. cn++;
  32. }
  33. for(i = 1; i < cn; ++i) {
  34. printf("%d ", c[i]);
  35. }
  36.  
  37. return 0;
  38. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement