杭电acm2071Max Num

Max Num

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16521    Accepted Submission(s): 10222


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

注:此题为:杭电OJ 2071Max Num

已AC代码:
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int n,i;
		float a,max=0;
		cin>>n;
		for(i=0;i<n;++i)
		{
			cin>>a;
			if(max<a)
  			max=a;
		}
		printf("%.2f\n",max);
	}
	return 0;
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/shouwang_tomorrow/article/details/45915775
个人分类: HDOJ
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭