Suppose that we need to devide 9 people into two volleyball teams (6+6). Usually we start with two captains (best players). First captain choose one player. After that second captain and first captain choose two players on each step. The problem is in bad players which may have negative weight in the team. And in the end of this procedure captains obliged to choose bad players.

This algorithm will work better if we'll complete the original group with 3 (3+9=12) virtual (empty) players (with zero weight). So each captain may take one of the empty player instead of negative ones.

Suppose that we need to divide 9 people into two volleyball teams. Usually we start with two captains (best players). First captain choose one player. After that second captain and first captain choose two players on each step. The problem is in bad players which may have negative weight in the team. And in the end of this procedure captains obliged to choose bad players.

This algorithm will work better if we'll complete the original group with 3 (3+9=12) virtual (empty) players (with zero weight). So each captain may take one of the empty player instead of negative ones.