PAT 1113 Integer Set Partition python解法

最新推荐文章于 2021-06-27 22:13:03 发布

D_ry

最新推荐文章于 2021-06-27 22:13:03 发布

阅读量241

点赞数

分类专栏： python 用Python刷PAT (Advanced Level) Practice

本文链接：https://blog.csdn.net/qq_36936510/article/details/85267222

版权

python 同时被 2 个专栏收录

69 篇文章 1 订阅

订阅专栏

用Python刷PAT (Advanced Level) Practice

48 篇文章 3 订阅

订阅专栏

1113 Integer Set Partition （25 分）
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≤10⁵ ), 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 2³¹ .

Output Specification:
For each case, print in a line two numbers: ∣n1 −n2 ∣ and ∣S1 −S2 ∣, separated by exactly one space.

Sample Input 1:
10
23 8 10 99 46 2333 46 1 666 555
Sample Output 1:
0 3611
Sample Input 2:
13
110 79 218 69 3721 100 29 135 2 6 13 5188 85
Sample Output 2:
1 9359

解题思路：先将数字排序，然后切成两半，用后一半减前一半。

n = int(input())
l = list(map(int,input().split()))
#n = 13
#l =[110, 79, 218, 69, 3721, 100, 29, 135, 2, 6, 13, 5188, 85]
l.sort()
#l1 = l[:n//2]
#l2 = l[n//2:n]
#s1 = sum(l1)
#s2 = sum(l2)
#print(len(l2)-len(l1),s2-s1)
print(len(l[n//2:n])-len(l[:n//2]),sum(l[n//2:n])-sum(l[:n//2]))