把一堆数平均分成N份，保证每一份的和接近于所有数之和除以N，不要求平分以后的每份数据个数相等。这是有现实的程序设计需求的，当时是3份。首先想到要先进行排序，再依次从已排序的数列中抽取，如何进行抽取方法有很多

-The average number of the pile is divided into N copies, make sure that each and close to all the number one divided by N, does not require split after the same number of each data. This is a realistic program design requirements, and was three copies. First thought to sort first, then followed by a number from a sorted column in the extraction, there are many ways how to extract