Preparing NOJ

# Max Num

1000ms 32768K

## Description:

There are some students in a class, Can you help teacher find the highest student .

## Input:

There are some cases. The first line contains an integer t, indicate the cases; Each case have an integer n ( 1 ≤ n ≤ 100 ) , followed n students’ height.

## Output:

For each case output the highest height, the height to two decimal plases;

## Sample Input:

2
3 170.00 165.00 180.00
4 165.00 182.00 172.00 160.00

## Sample Output:

180.00
182.00

Info

Provider HDU

Origin 浙江工业大学网络选拔赛

Code HDU2071

Tags

Submitted 1

Passed 1

AC Rate 100%

Date 06/03/2019 16:25:37

Related

Nothing Yet