请大家推荐对黑头有用的产品吧# Fashion - 美丽时尚
s*e
1 楼
give array of 2*n integers A,
partition it into two array of n element(A1,A2),
make their sum closest to each other(min | sum A1 - sum A2 | )
partition it into two array of n element(A1,A2),
make their sum closest to each other(min | sum A1 - sum A2 | )