Algorithm of 11799 - Horror Dash

Problem Description Link

Algorithm:

In this problem you are to find out the minimum speed
that the clown must maintain so as not to get caught
even if they keep on running forever.

so if you can find the maximum speed then it is the
minimum speed to continue the race
so
1. get input t(test case)
2. get input n(number of students)
3. speed of each students (speed)
    if(speed>max)
        max=speed;
4. print the max.