Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A1 and A2 of n1 and n2 numbers, respectively. Let S1 and S2 denote the sums of all the numbers in A1 and A2 , respectively. You are supposed to make the partition so that ∣n1 −n2 ∣ is minimized first, and then ∣S1 −S2 ∣ is maximized. Input Specification: Each input file contains one test case. For each case, the first line gives an integer N (2≤N≤105 ), and then N positive integers follow in the next line, separated by spaces. It is guaranteed that all the integers and their sum are less than 231 . Output Specification: For each case, print in a line two numbers: ∣n1 −n2 ∣ and ∣S1 −S2 ∣, separated by exactly one space.
将给出的数据分成两组，输出两组最小个数之差，输出两组各自和之差的最大值。将原数据排序，前一半为n1，后一半为n2；
