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

输入、输出方法自行设计，要易于操作、不易死机。-Assuming the ball over the weekend, when men and women to enter the ballroom, each lined up. When dancing began, followed by men' s and women' s teams from each of the teams head out of a person dubbed partner. If the initial number of teams are not the same, the longer that team who were waiting for the next one unpaired dance. Now asked to write an algorithm simulation partner pairing these problems. Input and output methods designed to easy to operate, easy to crash.