Описать структуру с именем ITINERARY

#include <iostream>
#include <stdlib.h>
#include <time.h>
#include <conio.h>
using namespace std;
 
struct ITINERARY
{
    char BEG[1024], END[1024];
    int NUM, DISTANCE;
};
 
ITINERARY* ReadITINERARYArray(int n)
{
    ITINERARY* _array = new ITINERARY[n];
    for (int i = 0; i < n; i++)
    {
        printf("Input BEG and END:\r\n");
        scanf_s("%s %s", &_array[i].BEG, 1024, &_array[i].END]
        , 1024);
        printf("Input NUM and DISTANCE:\r\n");
        scanf_s("%i %i", &_array[i].NUM, &_array[i].DISTANCE);
    }
    return _array;
}
 
void PrintITINERARYArray(ITINERARY* _array, int n)
{
    for (int i = 0; i < n; i++)
    {
        printf("NUM = %i\t BEG = %s\t END = %s\t DISTANCE = %i\r\n", _array[i].NUM, _array[i].BEG, _array[i].END, _array[i].DISTANCE);
    }
}
 
void SortArray(ITINERARY* &_array, int n)
{
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n - 1; j++)
        {
            if (_array[i].DISTANCE < _array[i + 1].DISTANCE)
            {
                ITINERARY temp = _array[i];
                _array[i] = _array[i + 1];
                _array[i + 1] = temp;
            }
        }
    }
}
 
void PrintNum(ITINERARY* _array, int n, int Number)
{
    for (int i = 0; i < n; i++)
    {
        if (_array[i].NUM == Number)
        {
            printf("NUM = %i\t BEG = %s\t END = %s\t DISTANCE = %i\r\n", _array[i].NUM, _array[i].BEG, _array[i].END, _array[i].DISTANCE);
            break;
        }
    }
    printf("Not found \r\n");
}
int main()
{
    srand(time(NULL));
    int n, num;
    printf("Input n :\r\n");
    scanf_s("%i", &n);
    ITINERARY *ROUT = ReadITINERARYArray(n);
    printf("ROUT = :\r\n");
    PrintITINERARYArray(ROUT, n);
    SortArray(ROUT, n);
    printf("Sorted ROUT = :\r\n");
    PrintITINERARYArray(ROUT, n);
    do
    {
        printf("Enter num = :\r\n");
        scanf_s("%i", &num);
        PrintNum(ROUT, n, num);
        printf("To exit, type E :\r\n");
    } while (_getch() != 'E');
    system("Pause");
    return 0;
}

#include <fstream>

std::vector<ITINERARY> ROUT = ReadITINERARYArray(n);

std::istream
std::ostream

#include <iostream>
#include <stdint.h>
#include <vector>
#include <string>
#include <functional>
#include <algorithm>
 
struct ITINERARY
{
    std::string BEG;
    std::string END;
    uint32_t NUM;
    double DISTANCE;
};
 
std::istream& operator >> (istream &in, ITINERARY &i);
std::ostream& operator << (ostream &out, const ITINERARY &i);
 
std::vector<ITINERARY> ReadITINERARYArray(int);
 
void PrintITINERARYArray(const std::vector<ITINERARY> &);
 
void SortArray(std::vector<ITINERARY> &);
 
void PrintNum(const std::vector<ITINERARY> &, const std::string &);
 
int main()
{
    std::cout << "Input n:\n";
    uint32_t n;
    std::cin >> n;
    
    std::vector<ITINERARY> ROUT = ReadITINERARYArray(int n);//ошибка...
    std::cout << "ROUT:\n";
    PrintITINERARYArray(ROUT);
    
    SortArray(ROUT);
    std::cout << "Sorted ROUT:\n";
    PrintITINERARYArray(ROUT);
    
    std::cout << "Input rout name:\n";
    std::string name;
    std::getline(std::cin, name);
    std::cout << "Find rout:\n";
    PrintNum(ROUT, name);//но это не точно...
    
    return 0;
}
 
std::istream& operator >> (istream &in, ITINERARY &i)
{
    std::cout << "Input BEG and END:\n";
    //if(in.rdbuff()->in_avail())
    in.ignore(); //?
    std::getline(in, i.BEG);
    std::getline(in, i.END);
    std::cout << "Input NUM and DISTANCE:\n";
    in >> i.NUM;
    in >> i.DISTANCE;
    return in;
}
 
std::ostream& operator << (ostream &out, const ITINERARY &i)
{
    out << "BEG: " << i.BEG << "\n"
        << "END: " << i.END << "\n"
        << "NUM: " << i.NUM << "\n"
        << "DISTANCE: " << i.DISTANCE << "\n\n";
    return out;
}
 
std::vector<ITINERARY> ReadITINERARYArray(int n)
{
    std::vector<ITINERARY> a(n);
    for (int i = 0; i < n; i++)
        std::cin >> a[i];
    return a;
}
 
void PrintITINERARYArray(const std::vector<ITINERARY> &array)
{
    for (const ITINERARY &i : array)
    {
        std::cout << i;
    }
}
 
void SortArray(std::vector<ITINERARY> &array)
{
    std::function<bool(const ITINERARY&, const ITINERARY&)> pred =
        [](const ITINERARY &l, const ITINERARY &r) -> bool
    {
        return l.NUM < r.NUM;
    };
    std::sort(array.begin(), array.end(), pred);
}
 
void PrintNum(const std::vector<ITINERARY> &array, const std::string &name)
{
    for(const ITINERARY &i : array)
    {
        const std::string &BEG = i.BEG;
        const std::string &END = i.END;
        if(name == BEG || name == END)
        {
            std::cout << i;
        }
    }
}