（Python）pta团体程序设计天梯赛——练习集(L2-017)

mo1412

于 2024-05-10 14:09:05 发布

阅读量228

点赞数 3

文章标签： python 算法数据结构

本文链接：https://blog.csdn.net/mo1412/article/details/138664077

版权

n=int(input())
list1=list(map(int,input().split()))
list1.sort()
#print(list1)
if n%2==0:
    sum1=sum2=0
    c=n//2
    for i in range(c):
        sum1+=list1[i]
    for i in range(c,n):
        sum2+=list1[i]
    diff=abs(sum1-sum2)
    print("Outgoing #: "+str(c))
    print("Introverted #: "+str(c))
    print("Diff = "+str(diff))
else:
    sum1=sum2=0
    c1=n//2
    for i in range(c1):
        sum1+=list1[i]
    for i in range(c1,n):
        sum2+=list1[i]
    diff1=abs(sum1-sum2)
       
    sum3=sum4=0
    c2=n//2+1
    for i in range(c2):
        sum3+=list1[i]
    for i in range(c2,n):
        sum4+=list1[i]
    diff2=abs(sum3-sum4)
    
    if diff1>diff2:
        print("Outgoing #: "+str(c1+1))
        print("Introverted #: "+str(c1))
        print("Diff = "+str(diff1))
    else:
        print("Outgoing #: "+str(c2))
        print("Introverted #: "+str(c2-1))
        print("Diff = "+str(diff2))