HDU2071_Max Num

最新推荐文章于 2024-08-22 20:10:34 发布

ZayneHuang

最新推荐文章于 2024-08-22 20:10:34 发布

阅读量314

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM-HDU 文章标签： ACM

本文链接：https://blog.youkuaiyun.com/github_36324732/article/details/53123483

ACM-HDU 专栏收录该内容

66 篇文章

订阅专栏

本文介绍了一个简单的程序设计问题，即如何从一组学生的身高数据中找出最高的学生。通过使用C语言，程序接收输入的学生数量及各学生的身高，并输出最高身高的数值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Max Num

http://acm.hdu.edu.cn/showproblem.php?pid=2071

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 22242 Accepted Submission(s): 13018

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

Author

Lily

#include <stdio.h>
main()  
{	int num,i,j,n;
	float height,max;
	scanf ("%d",&n);
	for (i=0;i<n;i++)
	{	scanf ("%d",&num);
		max=0;
    	for (j=0;j<num;++j)
    	{	scanf ("%f",&height);
       		if (height>max)
				max=height;
		}
		printf("%.2f\n",max);  
    } 
    return 0;  
}