#include <iostream>

using namespace std;

int n;
struct nod
{int info;
nod* leg;
};

nod* creare()
{
    nod*prim,*ultim,*p;
    int nr;
    prim=new nod;
    ultim=prim;
    cout<<"Nr: ";
    cin>>nr;
    if(nr==0)
    {
        cout<<"Lista este vida";
        return 0;
    }
    else
    {
        prim->info=nr;
        prim->leg=NULL;
        cout<<"Nr: "; cin>>nr;
        while(nr)
        {
            p=new nod;
            p->info=nr;
            ultim->leg=p;
            ultim=p;
            ultim->leg=NULL;
            cout<<"Nr: "; cin>>nr;
        };
        return prim;
    }
}

void parcurgere(nod*prim)
{
    nod*p;
    p=prim;
    while(p)
    {
        cout<<p->info<<" ";
        n++;
        p=p->leg;
    }
}

int main()
{
    nod *prim1,*prim2,*p,*q,*prim,*t,*r,*z,*w;
    prim1=creare();
    prim2=creare();

    parcurgere(prim1);
    cout<<endl;
    parcurgere(prim2);
    cout<<endl;

    prim=new nod;
    prim->leg=NULL;

    if(prim1->info<prim2->info)
    {
        prim->info=prim1->info;
        p=p->leg;
    }
    else
    {
        prim->info=prim2->info;
        q=q->leg;
    }

    p=prim1;
    q=prim2;

    r=p;
    t=q;
    z=prim;
    while(p&&q)
    {
        w=new nod;
        w->leg=NULL;
        z->leg=w;
        if(p->info<q->info)
        { w->info=p->info;
        p=p->leg;}
        else
        {
            w->info=q->info;
            q=q->leg;
        }
    }
    z=w;

    while (p)
    {
        w=new nod;
        w->leg=NULL;
        w->info=p->info;
        z->leg=w;
        z=w;
        p=p->leg;
    }

    while(q)
    {
        w=new nod;
        w->leg=NULL;
        w->info=q->info;
        z->leg=w;
        z=w;
        q=q->leg;
    }

    parcurgere (prim);

    return 0;
}