Help me in solving DSSA110 problem

help
,
1

My issue

code

My code

# cook your dish here
def first_fit_decreasing_bin_packing(item_sizes, bin_capacity):
    sorted_item_sizes = sorted(item_sizes, reverse=True)
 
    even =[]
    odd =[]
    
    for ele in sorted_item_sizes:
        if ele%2 ==0:
            even.append(ele)
        else:
            odd.append(ele)
    
    ans =0
    
    ans += pack(even , bin_capacity)
    ans += pack(odd , bin_capacity)
    
    return ans
    
def pack(items , bin_capacity):
    bins = []
    
    for item in items:
        placed = False
        for i in range(len(bins)):
            if bins[i] + item <= bin_capacity:
                bins[i] += item
                placed = True
                break
        if not placed:
            bins.append(item)

    return len(bins)
    

t = int(input())
for _ in range(t):
    N, M = map(int, input().split())
    arr = list(map(int, input().split()))
    
    result = first_fit_decreasing_bin_packing(arr, M)
    print(result)

Learning course: Design and Analysis of Algorithms
Problem Link: https://www.codechef.com/learn/course/kl-daa/KLDAA2400G/problems/DSSA110