二、舞伴问题 （难度系数： 1.1)

假设在周末舞会上，男士和女士进入舞厅时，各自排成一队。跳舞开始时，依次从男队和女队的队头上各出一人配成舞伴。若两队初始人数不相同，则较长的那一队中未配对者等待下一轮舞曲。现要求写一算法模拟上述舞伴配对问题。-Second, partner issues (degree of difficulty: 1.1) It is assumed that the ball at the weekend, men and women to enter the ballroom, the respective teams lined up. Dance begins, followed by men s and women s teams from the teams head out of one pair each partner. If two teams are not the same as the initial number, the longer the team is not matching those waiting for the next round of dance. Are now required to write a simulation of the above-mentioned partner-matching algorithms problems.