HDU 2071 Max Num

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

LZK1997

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

阅读量360

点赞数

CC 4.0 BY-SA版权

分类专栏： hdu oj

本文链接：https://blog.youkuaiyun.com/LZK1997/article/details/74011856

hdu oj 专栏收录该内容

122 篇文章

订阅专栏

此程序通过输入多个学生的身高数据，使用C++实现了一个简单的算法来找出每个案例中最高的学生身高，并输出保留两位小数的最高身高。

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

好久没刷题了，找找手感，用double就可以过，提交c++

Max Num

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

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

Source

浙江工业大学网络选拔赛

Recommend

linle | We have carefully selected several similar problems for you: 2081 2096 2072 2061 2090

ac代码

#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#define MAX 0x3f3f3f3f
using namespace std;

double a[105];

int main()
{
	int n,m;
	
	scanf("%d",&n);
	while(n--){
		scanf("%d",&m);
		for(int i=0;i<m;i++){
			scanf("%lf",a+i);
		}
		sort(a,a+m);
		printf("%.2lf\n",a[m-1]);
	}
	
	return 0;
}