HDU 2071 Max Num

                    Max Num

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

题意是找到最大数，很简单啦~
1.朴素的写法

#include<stdio.h>
int main(){
    int T,n,i;
    double height[110],max;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(i=1;i<=n;i++)
            scanf("%lf",&num[i]);
        max=num[1];
        for(i=2;i<=n;i++)
            if(max<height[i])
                max=num[i];
        printf("%.2lf\n",max);
    }
}

2.偷懒的写法，可以去看看sort()函数哦

#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
    int T,n;
    double num[110];
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(int i=0;i<n;i++) scanf("%lf",&num[i]);
        sort(num,num+n);
        printf("%.2lf\n",num[n-1]); 
    }   
}