HDU 2071 Max Num
来源:互联网 发布:课时优化八上英语答案 编辑:程序博客网 时间:2024/05/17 07:25
好久没刷题了,找找手感,用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
23 170.00 165.00 180.004 165.00 182.00 172.00 160.00
Sample Output
180.00182.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 0x3f3f3f3fusing 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;}
阅读全文
0 0
- HDU 2071 Max Num
- HDU 2071 Max Num
- hdu-2071-Max Num
- hdu 2071 Max Num
- HDU 2071 Max Num
- HDU 2071 Max Num
- HDU 2071 -- Max Num
- HDU 2071 Max Num
- HDU 2071 Max Num
- hdu 2071 Max Num
- C++ hdu 2071 Max Num
- hdu 2071 Max Num (水题)
- HDU——2071Max Num
- 2071 Max Num
- Max Num 2071
- 2071 Max Num
- HDUJ 2071 Max Num
- hd 2071 Max Num
- JZOJ 5185. 【NOIP2017提高组模拟6.30】tty's sequence
- Spring 架构篇——使用 Spring Boot Actuator 监控端点
- springcloud(第八篇)springcloud feign
- 【XML】将String格式的XML文件转化成JAVA实体类
- 算法笔记--排列组合
- HDU 2071 Max Num
- 二分搜索—— 完全二叉树统计节点个数
- LeetCode 563 Binary Tree Tilt(递归 + 中间结果保存)
- PythonTip 50道题目(部分题解)
- nefuoj1206-dp-环形子段和
- Java Integer的缓存问题
- 网址收藏
- Alphago原理浅析
- strcat,strncat函数