Массив структур с динамическим распределением памяти

//---------------------------------------------------------------------------
 
#include <iostream.h>
#include <conio.h>
#include <stdlib.h>
#pragma hdrstop
#include "structur.h"
 
//---------------------------------------------------------------------------
 
void displayRecord (int, pipleListRecord plRec);
int main(int, char**)
{
pipleListRecord* listArray[5];
listArray[5] = new pipleListRecord;
cout << endl;
int index = 0;
do {
cout << "Name: ";
cin.getline(listArray[index]->Name,
sizeof(listArray[index]->Name) - 1);
 
cout << "Famely: ";
cin.getline(listArray[index]->Famely,
sizeof(listArray[index]->Famely) - 1);
 
cout << "Adress: ";
cin.getline(listArray[index]->Adress,
sizeof(listArray[index]->Adress) - 1);
 
cout << "Data: ";
cin.getline(listArray[index]->Data,
sizeof(listArray[index]->Data) - 1);
 
char buff[10];
cout << "Strah: ";
cin.getline(buff, sizeof(buff) - 1 );
listArray[index]->Strah = atoi(buff);
index++;
cout << endl;
}
while (index < 5);
clrscr();
for (int i = 0; i < 5; i++) {
displayRecord(i, *listArray[i]);
}
cout << "Choose a record: ";
char rec;
do {
rec = getch();
rec -= '1';
} while (rec < 0 || rec >4);
pipleListRecord temp = *listArray[rec];
clrscr();
cout << endl;
displayRecord(rec, temp);
getch();
        return 0;
}
void displayRecord(int num, pipleListRecord plRec)
{
cout << "Record " << num + 1 << ":" << endl;
cout << "Name: " << plRec.Name << " ";
cout << endl <<
cout << "Famely: " << plRec.Famely << " ";
cout << endl <<
cout << "Adress: " << plRec.Adress << " ";
cout << endl <<
cout << "Data: " << plRec.Data << " ";
cout << endl <<
cout << plRec.Name << " ";
cout << plRec.Famely << " ";
cout << plRec.Adress << " ";
cout << plRec.Data << " ";
cout << plRec.Strah;
cout << endl << endl;
}
//---------------------------------------------------------------------

pipleListRecord* listArray[5];
listArray[5] = new pipleListRecord;