Max Num
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14750 Accepted Submission(s): 9271
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> #include <stdlib.h> int main() { int i,t,n; float height[100],max; scanf("%d",&t); while(t--) { max=0.0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%f",&height[i]); if(height[i]>max) max=height[i]; } printf("%.2f\n",max); } system("pause"); return 0; }