fork download 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5.     int n, m, v[100001], w[100001];
  6.     cin >> n;
  7.     for (int i = 1; i <= n; ++i) { // Citim sirul v
  8.         cin >> v[i];
  9.     }
  10.     cin >> m;
  11.     for (int i = 1; i <= m; ++i) { // Citim sirul w
  12.         cin >> w[i];
  13.     }
  14.     int aux[n + m]; //noul sir format
  15.     int k = 0; //cu ajutorul acestei variabile vom pune elementele in noul sir format
  16.     int i = 1, j = 1;
  17.     //vom parcurge simultan cele doua siruri si vom compara elementele
  18.     while (i <= n && j <= m) {
  19.         if (v[i] < w[j]) //punem cel mai mic element dintre cele doua
  20.         {
  21.             k++;
  22.             aux[k] = v[i];
  23.             i++;
  24.         } else {
  25.             k++;
  26.             aux[k] = w[j];
  27.             j++;
  28.         }
  29.     }
  30.     // exista posibilitate sa terminam elementele dintr-un sir, iar din altul nu
  31.     while (i <= n) {
  32.         k++;
  33.         aux[k] = v[i];
  34.         i++;
  35.     }
  36.  
  37.     while (j <= m) {
  38.         k++;
  39.         aux[k] = w[j];
  40.         j++;
  41.     }
  42.     // afisam noul sir
  43.     for (i = 1; i <= k; i++) {
  44.         cout << aux[i] << ' ';
  45.     }
  46.     return 0;
  47. }
Success #stdin #stdout 0s 5280KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/GZu2on
language:
C++ (gcc 8.3)
created:
78 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!