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

 #include "iostream"
using namespace std;
int main()
{
    int n ;
    cin>>n;
    double res = 0;
    cout.setf(ios::fixed);
    cout.precision(2);
    for(int i = 0;i<n;i++)
    {
        int m;
        cin>>m;
        double s[m];
        for(int j=0;j<m;j++)
        {
            cin>>s[j];
            if(s[j]>res)
                res = s[j];
        }
        cout<<res<<endl;
    }
}