For this Question: Given an array A of size N,  you need to find its maximum, 2<sup>nd</sup> maximum and 3<sup>rd</sup> maximum element.
Try solving it in O(N) per test caseThe first line of the input contains the number of test cases T.
For each test case, the first line of the input contains an integer N denoting the number of elements in the array A. The following line contains N (space-separated) elements of A.


<b>Constraints:</b>
1 <= T <= 100
3 <= N <= 10<sup>6</sup>
1 <= A[i] <= 10<sup>9</sup>
<b>Note</b>:-It is guaranteed that the sum of N over all text cases does not exceed 10<sup>6</sup>For each test case, output the first, second and third maximum elements in the array.Sample Input:
3
5
1 4 2 4 5
6
1 3 5 7 9 8
7
11 22 33 44 55 66 77

Sample Output:
5 4 4
9 8 7
77 66 55

<b>Explanation:</b>
Testcase 1: 
[1 4 2 4 5]
First max = 5
Second max = 4
Third max = 4, I have written this Solution Code: t=int(input())
while t>0:
    t-=1 
    n=int(input())
    l=list(map(int,input().strip().split()))
    li=[0,0,0]
    for i in l:
        x=i
        for j in range(0,3):
            y=min(x,li[j])
            li[j]=max(x,li[j])
            x=y
    
    print(li[0],end=" ")
    print(li[1],end=" ")
    print(li[2]), In this Programming Language: Python, Now tell me if this Code is compilable or not?