Программа "структуры". Расписание поездов.

#include <vcl.h>
#include <stdio.h>
#include <conio.h>
#include <math.h>
#include <iostream>
#include <fstream.h>
#pragma hdrstop
 
struct client
{
char surname[20];
int num;
double deposit;
double total;
};
 
 
int sum500(client * clients,int n);
int clientinfo(client * clients,int n);
int sort(client * clients,int n);
int main(int argc, char* argv[]);
 
#pragma argsused
 
 
//клиенты, имеющие общую сумму более 500000 руб
int sum500(client * clients,int n)
{
bool flag=false;
printf( " \n");
printf( "list of clients >500000\n");
for (int i = 0; i < n; i++)
  {
  if (clients[i].total>500000)
    {
    printf( "%s \n", clients[i].surname);
    flag=true;
    }
  }
if(!flag)
printf("client's with total sum >500000 doesn't exist");
return 0;
}
 
//информация о клиенте по заданному номеру счета
int clientinfo(client * clients,int n)
{
printf( " \n");
int k;
bool flag=false;
std::cout << "input client's id: ";//<< std::endl;
std::cin >> k;
 
for (int i = 0; i < n; i++)
  {
  if (clients[i].num==k)
    {
     printf( "%s %d %8.0lf %8.0lf\n", clients[i].surname, clients[i].num, clients[i].deposit,clients[i].total );
     flag=true;
    }
  }
if(!flag)
printf("client's id doesn't exist");
}
 
//сортировка по полю "общая сумма"
int sort(client * clients,int n)
{
client  buf;
bool changed=true;
 
do{
changed = false;
for(int i= 0;i < n-1;i++)
  {
  if (clients[i].total > clients[i+1].total)
    {
    buf=clients[i];
    clients[i]=clients[i+1];
    clients[i+1]=buf;
    changed=true;
    }
  }
}while(changed);
}
 
 
int main(int argc, char* argv[])
{
 
int n;
 
 
FILE * f;
 
  f = fopen("test.txt","rt");
  fscanf( f, "%d",&n);
  client *clients= new client[n]  ;
 
  int i=0;
  while( !feof(f) ) {
      fscanf( f, "%s %d %lf", &clients[i].surname, &clients[i].num, &clients[i].deposit );
      clients[i].total=clients[i].deposit*1.2;
      printf( "%s %d %8.0lf %8.0lf\n", clients[i].surname, clients[i].num, clients[i].deposit,clients[i].total );
      clients[i].total=clients[i].deposit*1.2;
      i++;
    }
 
sum500(clients,n);
clientinfo(clients,n);
sort(clients,n);
 
printf("\n\nsorted list of clients:\n");
 
for (int i = 0; i < n; i++)
  printf( "%s %d %8.0lf %8.0lf\n", clients[i].surname, clients[i].num, clients[i].deposit,clients[i].total );
 
getch();
fclose(f);
return 0;
}