hdu2071

最新推荐文章于 2022-03-10 10:44:42 发布

weixin_30613343

最新推荐文章于 2022-03-10 10:44:42 发布

阅读量187

点赞数

原文链接：http://www.cnblogs.com/chen47221/archive/2013/04/24/3039332.html

版权

Max Num

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10292 Accepted Submission(s): 6590

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 
  

#include<stdio.h>
int main()
{
int n,m;double max,a;
scanf("%d",&n);
while(n--)
{
 scanf("%d",&m);
 max=0;
 while(m--)
 {
 scanf("%lf",&a);
 if(a>max)max=a;
 }
 printf("%.2lf\n",max);
}
}