Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13674 Accepted Submission(s): 8661
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
int main()
{
	int n,ni,j,ji;
	double num[100],ans;
	scanf("%d",&n);
	for(ni=0;nians)
			{
				ans=num[ji];
			}
		}
		printf("%.2lfn",ans);
	}
	return 0;
}

其实还是有运气的成分在里面,因为样例中的数据可能都是精确到小数点后两位,所以可以通过.2lf直接输出.还没有想到可以直接根据输入数据给出输出精度的方法.