A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two teams must not differ by more than 1; the total weight of the people on each team should be as nearly equal as possible.
The first line of input contains n the number of people at the picnic. n lines follow. The first line gives the weight of person 1; the second the weight of person 2; and so on. Each weight is an integer between 1 and 450. There are at most 100 people at the picnic.
Your output will be a single line containing 2 numbers: the total weight of the people on one team, and the total weight of the people on the other team. If these numbers differ, give the lesser first.
3 100 90 200
分析：有n个人，要分成2组，每个人有一个体重，要求两组人的总体重尽可能的接近。两个组的人数只差不得超过1.分别输出两个组分好后，人员总体重。总体重小的那个组先输出，中间隔一个空格。典型的01背包动态规划。人数一定，找出最接近中间值的那个数即可。动态转移方程： if(dp[j][k]) dp[j+1][k+wei[i]]=true;