HDOJ--2071--Max Num

题目描述：
There are some students in a class, Can you help teacher find the highest student .
输入描述:
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.
输出描述:
For each case output the highest height, the height to two decimal plases;
输入：
2
3 170.00 165.00 180.00
4 165.00 182.00 172.00 160.00
输出：
180.00
182.00
题意：
找最高的学生
题解：
直接找最大值
代码：

#include<cstdio>
#include