int main(int argc, const char * argv[]) {
Tgroup contestants;
int size = readGroup(&contestants);
int winner_index = findLeast_time(contestants, size);
calc_timeLag(&contestants, size, winner_index);
printf("\nThe winner is:\n\n");
printWinners(contestants, size, winner_index);
printf("\nThe result list:\n\n");
printLoosers(contestants, size, winner_index);
printf("\n\n"); return 0;
}
int main ( int argc, char *argv[] )
{
int T;
scanf("%d",&T);
while(T-- > 0)
{
int p,c;
scanf("%d %d",&p,&c);
int i=0;
int j=0;
PlayerSc PS[p]; //Declaring array of structure of p palyers
while(i<p)
{
PS[i].max=0;
scanf("%s",PS[i].name);
j=0;
for(j=0; j<c; j++)
scanf("%d %d",&PS[i].scP[j][0],&PS[i].scP[j][1]);
i++;
}
// display(PS,p,c);
int unknown=-1;
for(j=0; j<c; j++) {
char str1[10];
char str2[10];
scanf("%s %s",str1,str2);
int ret=calMax(PS,p,c,str1,str2,j);
if(ret!=-1)
unknown=ret;
}
// display(PS,p,c);
int arrW[p];
int val=CalcWinners(PS,p,c);
if(unknown!=-1)
{
PWinnerUnk(PS,p,c,unknown,arrW);
i=0;
int cnt=0;
for(i=1; i<p; i++)
{
if(arrW[i-1]==arrW[i])
cnt++;
else
break;
}
if(cnt==p-1)
{
printWinners(PS,p,c,val,15);
}
else
{
printWinners(PS,p,c,val,10);
}
}
else
{
//printf("val: %d \n",val);
printWinners(PS,p,c,val,0);
}
}
return EXIT_SUCCESS;
}
