落絮飞雁的个人网站

顺流而下,把梦做完

HDOJ2071:Max Num

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13674 Accepted Submission(s): 8661
Problem 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
 

水题,放上代码:

其实还是有运气的成分在里面,因为样例中的数据可能都是精确到小数点后两位,所以可以通过.2lf直接输出.还没有想到可以直接根据输入数据给出输出精度的方法.
 


原文标题:HDOJ2071:Max Num|落絮飞雁的个人网站
原文链接:https://www.luoxufeiyan.com/2014/08/04/hdoj2071max-num/
授权协议:创作共用 署名-非商业性使用 2.5 中国大陆
除注明外,本站文章均为原创;转载时请保留上述链接。