数据结构实现舞会问题

#include <stdio.h>
#include <string.h>
#include <malloc.h>
#include <stdlib.h>

#define MAXSIZE 100 

typedef struct{
	char name[10];
	char team;
}Player;
typedef struct{
	Player A[MAXSIZE];
	int front;
	int rear;
}A;
typedef struct{
	Player B[MAXSIZE];
	int front;
	int rear;
}B;
void Macth(A *a,B *b,Player people[],int x){
	int i;
	for(i=1;i<x;i++){
		if(people[i].team=='A'){
		strcpy(a->A[a->rear].name,people[i].name);
		a->A[a->rear].team=people[i].team;
		a->rear=(a->rear+1)%MAXSIZE;	
		}
		else if(people[i].team=='B'){
		strcpy(b->B[b->rear].name,people[i].name);
		b->B[b->rear].team=people[i].team;
		b->rear=(b->rear+1)%MAXSIZE;
		}
	}
}
void JoinMacth(A *a,B *b){
	while(a->rear!=a->front&&b->rear!=b->front){
	    printf("A队有%s————B队有%s\n",a->A[a->front].name,b->B[b->fr