Monu lives in a society which is having high rise buildings. This is the time of sunrise and monu wants see the buildings receiving the sunlight. Help him in counting the number of buildings recieving the sunlight.
Given an array H representing heights of buildings. You have to count the buildings which will see the sunrise (Assume : Sun rise on the side of array starting point).
The first line of input contains an integer T denoting the number of test cases. The first line of each test case is N, N is the number of buildings. The second line of each test case contains N input H[i], height of ith building.
Print the total number of buildings which will see the sunset.
1 ≤ T ≤ 100
1 ≤ N ≤ 106
1 ≤ Hi ≤ 108
7 4 8 2 9
2 3 4 5
Testcase 1: Building with height 7, 8 and 9 will recieve the sunlight during sunrise.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.