Help me in solving DSSA03 problem solution

My issue

My code

# cook your dish here
def minimum_shots_to_visible(T, test_cases):
    for t in range(T):
        N, K = test_cases[t][0], test_cases[t][1]
        player_heights = test_cases[t][2]
        shots = 0
        for height in player_heights:
            if height >= K:
                shots += 1

# Input handling
T = int(input())  # Read the number of test cases
test_cases = []
for _ in range(T):
    N, K = map(int, input().split())  # Read N and K for each test case
    heights = list(map(int, input().split()))  # Read the heights of players
    test_cases.append((N, K, heights))

minimum_shots_to_visible(T, test_cases)

Learning course: Kalasalingam Academy of Research and Education
Problem Link: CodeChef: Practical coding for everyone