Max Num
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16818 Accepted Submission(s): 10381
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,a,i,j;
double s[],max;
scanf("%d",&n);
while(n--)
{
scanf("%d",&a);
for(i=;i<a;i++)
scanf("%lf",&s[i]);
max=s[];
for(i=;i<a;i++)
max=max>s[i]?max:s[i];
printf("%.2lf\n",max);
}
return ;
}