杭电ACM-2071 Max Num

最新推荐文章于 2021-10-18 15:32:52 发布

不凡Zzz

最新推荐文章于 2021-10-18 15:32:52 发布

阅读量395

点赞数

分类专栏：杭电ACM

本文链接：https://blog.csdn.net/qq_36791466/article/details/80471332

版权

杭电ACM 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Max Num

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

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

没什么好说的，计算最大值，两位小数输出。

AC代码如下：

#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
	int n,m;
	double num,max;             
	
	cin>>n;
	for(int i=0;i<n;i++)
	{   max=0.00;                 //初始化最好放在外循环里。
		cin>>m;
		for(int j=0;j<m;j++)
		{
			cin>>num;
			if(num>max)          //比较最大值，置换
			{
				max=num;
			}
			else continue;
		}
		cout<<fixed<< setprecision(2)<<max<<endl;    //两位输出
	}
	return 0;
}