Max Num---hdu2071

Max Num
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16818 Accepted Submission(s): 10381


[align=left]Problem Description[/align]
There are some students in a class, Can you help teacher find the highest student .

[align=left]Input[/align]
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.

[align=left]Output[/align]
For each case output the highest height, the height to two decimal plases;

[align=left]Sample Input[/align]

2
3 170.00 165.00 180.00
4 165.00 182.00 172.00 160.00

[align=left]Sample Output[/align]

180.00
182.00

1 #include<stdio.h>
2 int main()
3 {
4     int n,a,i,j;
5     double s[101],max;
6     scanf("%d",&n);
7     while(n--)
8     {
9         scanf("%d",&a);
10         for(i=0;i<a;i++)
11         scanf("%lf",&s[i]);
12         max=s[0];
13         for(i=1;i<a;i++)
14         max=max>s[i]?max:s[i];
15         printf("%.2lf\n",max);
16     }
17     return 0;
18 }