188832025-11-08 14:21:32birozsOsztozkodás (75 pont)python3Wrong answer 54/75600ms14792 KiB
N,K = map(int,input().split())
T = list(map(int,input().split()))
T.sort(reverse=True)
Anna = 0
Bea = 0
i = 0
while i < N:
    if N - i > K:
        Anna += T[i]
        i += 1
        if N - i > K:
            Bea += T[i]
            i += 1
        else:
            if T[i] > sum(T[i+1:]):
                Bea += T[i]
                i += 1
            else:
                Bea += sum(T[i:])
                i = N
    else:
        if T[i] > sum(T[i+1:]):
            Anna += T[i]
            i += 1
        else:
            Anna += sum(T[i:])
            i = N
        if i < N and T[i] > sum(T[i+1:]):
            Bea += T[i]
            i += 1
        elif i < N:
            Bea += sum(T[i:])
            i = N
print(Anna,Bea)          
SubtaskSumTestVerdictTimeMemory
base54/75
1Accepted0/016ms3128 KiB
2Accepted0/017ms3124 KiB
3Accepted2/217ms3156 KiB
4Wrong answer0/317ms3332 KiB
5Accepted3/316ms3120 KiB
6Accepted2/217ms3380 KiB
7Accepted3/318ms3460 KiB
8Accepted2/218ms3588 KiB
9Accepted3/318ms3324 KiB
10Accepted2/218ms3328 KiB
11Accepted3/317ms3420 KiB
12Accepted1/1116ms14300 KiB
13Accepted2/2115ms14184 KiB
14Accepted1/1114ms14184 KiB
15Accepted2/279ms14336 KiB
16Wrong answer0/1123ms13564 KiB
17Wrong answer0/2135ms14416 KiB
18Wrong answer0/1114ms13456 KiB
19Wrong answer0/282ms11244 KiB
20Wrong answer0/276ms11380 KiB
21Accepted3/3114ms14644 KiB
22Wrong answer0/2123ms14400 KiB
23Accepted3/3119ms14688 KiB
24Accepted2/2115ms14792 KiB
25Accepted3/3112ms14624 KiB
26Accepted2/2108ms14620 KiB
27Time limit exceeded0/3600ms14352 KiB
28Time limit exceeded0/2574ms14212 KiB
29Accepted3/3116ms14184 KiB
30Accepted3/316ms3132 KiB
31Accepted3/316ms3088 KiB
32Wrong answer0/317ms3312 KiB
33Accepted3/316ms3128 KiB
34Accepted3/316ms3124 KiB