Interclasare a 2 vectori, citire fisier

//Input
//5 8
//2 4 7 37 42
//88 88 67 45 42 32 4 1
//Output
//2 4 4 32 42 42 88 88
//practic preia din cei 2 vectori(unu care e crescator si celalalt escrescator), elimina toate numerele care se gasesc de 2 sau mai multe ori si creeaza un nou sir crescator fara dubluri
#include <conio.h>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("interclasare3.in");
ofstream fout("interclasare3.out");

void citireVector(int *p,int contorp) {
    for (int i = 0; i < contorp; i++) {
        fin >> p[i];
    }
}

int* contopireVectori(int* p1, int* p2, int contorp1, int contorp2,int &contorp3) {
    //int c[2000],k=0;
    int *p3 = new int[contorp1+contorp2];
    //Introducere a tuturor elementelelor pare din primul vector in noul vector
    for (int i = 0; i < contorp1; i++) {
        if (p1[i] % 2 == 0) {
            p3[contorp3++] = p1[i];
        }
    }

    //Introducere a tuturor elementelor pare din al 2-lea vector in noul vector
    for (int i = 0; i < contorp2; i++) {
        if (p2[i] % 2 == 0) {
            p3[contorp3++] = p2[i];
        }
    }

    return p3;
}
void interclasare(int* p, int &contor) {
    vector<int> myVector(p, p + contor);
    sort(myVector.begin(), myVector.end());
    for (int i = 0; i < myVector.size(); i++) {
        p[i] = myVector[i];
    }

}

void main() {
    int a[1000], b[1000], *c = new int[2000], n, m, *k = new int;
    *k = 0;
    //Citire contori
    fin >> n;
    fin >> m;

    citireVector(a, n);
    citireVector(b, m);
    c = contopireVectori(a, b, n, m, *k);
    interclasare(c, *k);

    for (int i = 0; i < *k; i++) {
        if (i % 20 == 0)
            cout << endl;
        fout << c[i] << " ";
    }

}