Problem 2071-Max Num

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2071

题目描述：

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<cstdio>
using namespace std;
int main()
{
    int n,a;
    double h[101],max;
    scanf("%d",&n);
    while(n--){
        scanf("%d",&a);
        for(int i=0;i<a;i++){
            scanf("%lf",&h[i]);
        }
        max=h[0];
        for(int j=1;j<a;j++){
            max=max>h[j]?max:h[j]; 
        }
        printf("%.2lf
",max);
    }
    return 0;
 }