hd 2071 Max Num

最新推荐文章于 2025-06-06 09:10:58 发布

lc311309010103

最新推荐文章于 2025-06-06 09:10:58 发布

阅读量332

点赞数

CC 4.0 BY-SA版权

分类专栏：排序

本文链接：https://blog.youkuaiyun.com/lc311309010103/article/details/38395475

排序专栏收录该内容

12 篇文章

订阅专栏

本文深入探讨了AI音视频处理领域中的关键技术，特别是视频分割与语义识别，详细解释了如何利用这些技术实现更智能的音视频应用。

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

Max Num

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

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: 2055 2081 2072 2058 2052

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    int t,n,i;
    double a[110];
    while(scanf("%d",&t)!=EOF)
    {
      while(t--)
      {
        scanf("%d",&n);
        for(i=0;i<n;i++)
        {
          scanf("%lf",&a[i]);
                        }
          sort(a,a+n);
          printf("%.2f\n",a[n-1]);
                }
                              }
    return 0;
}