HDOJ--2071

Max Num

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

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
  
  

 

水题直接给出代码：

#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
const int MAXN=1010;
using namespace std;
double a[MAXN];
int main()
{
    int num;
    cin>>num;
    while(num--)
    {
        int n;
        cin>>n;
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        sort(a,a+n);
        cout.precision(2);
        cout<<fixed<<a[n-1]<<endl;
    }
    return 0; 
}