gyak6Doope

#include <iostream>
#include <cstdlib>
#include <time.h>

using namespace std;

void be_i(int als,int fels,string szoveg,int &l) {
    bool hiba;
   cout << szoveg;

    do {
        cin >> l;
        hiba= ((l < als) || (l > fels));
    } while (hiba);
}

void be_tomb(int p,int A[],string s) {
    int i;
    cout << s;
    for (i=1;i <=p ; i++) {
       cout << "Kerem az ";
       cout << i;
       cout << " elemet";
       cin >> A[i];
    }
}

void ki_tomb(int n,int A[]) {
    int i;
    cout << "A sorozat eleme";
    for (i=1;i<=n;i++) {
        cout << A[i] << " ";
    }
    cout << endl;
}

bool benne(int x,int m, int B[]) {
    int j=1;
    while ((j<m) && (x!=B[j])) {
        j++;
    }
    return (j<=m);
}

/*void metszet(int n,int A[],int m,int B[],int &db,int C[]) {

    int db = 0;
    for (int i;i<n;i++) {

    }
}
*/
void unio(int n,int A[],int m,int B[],int &db,int C[]) {
    db=0;
    int i = 0;
    while(i<n) {
        i++;
        db++;
        C[db]=A[i];
    }
    i = 0;
    while (i<m) {
        if (benne(B[i],db,C)) {
            i++;
            db++;
            C[db]=B[i];
        }
    }

}
int main()
{
    int n;
    be_i(1,100,"Kerem az 1. elemszamot:",n);
    int m;
    be_i(1,100,"Kerem az 2. elemszamot:",m);
    int A[n+1];
    int B[m+1];
    be_tomb(n,A,"Az elso sorozat ");
    be_tomb(m,B,"Az masodik sorozat ");
    int db = 0;
    int C[n];
    unio(n,A,m,B,db,C);
    ki_tomb(db,C);


/* unio db = 0;
    while:i=1,n;
    db=db+1; Cdb = Ai
    while: i=1,m;
    if !benne(Bi,db,C)
    db = db+1;
    Cdb=Bi;
*/

/* A-B
db=0;
while i=i,n;
    if !benne(A[i],m,B)
        db++;
        Cdb=Ai;
*/



/*
   ( A unio B) -( A metszet B)
*/
}