1993B - Parity and Sum - CodeForces Solution

def fariq(n,l):
    odd, even = [], []
    for i in l:
        if i % 2 == 0: even += [i]
        else: odd += [i]
    if odd == [] or even == []:return 0
    else:
        odd.sort()
        even.sort()
        max_odd = max(odd)
        ans = 0
        for i in even:
            if i < max_odd:
                max_odd += i
                ans += 1
            else:
                max_odd += 2 * max(even)
                ans += 2
        return ans
for _ in range(int(input())):
    n = int(input())
    l = list(map(int, input().split()))
    print(fariq(n,l))