假设在周末舞会上，男士和女士进入舞厅时，各自排成一队。跳舞开始时，依次从男队和女队的队头上各出一人配成舞伴。若两队初始人数不相同，则较长的那一队中未配对者等待下一轮舞曲。现要求写一算法模拟上述舞伴配对问题。



输入、输出方法自行设计，要易于操作、不易死机。

-Assuming the ball at the weekend, men and women into the ballroom, the respective queue. Dance begins, followed by men' s and women' s teams from the teams head out of one of the paired partners. If the initial number of teams is not the same, no longer in that team were waiting for the next round of the dance pairs. Are asked to write an algorithm simulating the partner matching problem. Input and output methods to design, to be easy to operate, easy to crash.