Contest3145 - the 37th game of 2021 freshman individual training match_ F: Smallest ball

//
 problem  F:  Smallest ball 
 The time limit : 1.000 Sec   Memory limit : 128 MB
 
 Title Description 
 Xiaohua is a cat who loves table tennis very much , Recently, it sneaked into the closed training ground of the Chinese table tennis team （ In preparation for the war 2017 World Table Tennis Championships in Germany , The Chinese men's team is in Shenzhen , The women's team is in Huangshi, Hubei , Conduct closed training separately ）, Secretly playing table tennis . Floret found that the size of these balls is not exactly the same , It's a slight difference in size , After playing for a long time, it found that the smallest one was the most fun . Now Xiaohua wants to know the smallest of a pile of table tennis balls with known diameters .
 Input 
 There are two lines of input data , The first line is a positive integer n, Indicates the number of table tennis balls . The second line is n Floating point types （ Two digits after the decimal point ）, Represents the diameter of each ball d（ In millimeters ）, Numbers are separated by a space ,1<=n<=100,40<=d<41.
 Output 
 The output has only one floating-point type per line , Represents the diameter of the smallest ball , Still keep two decimal places .
 The sample input  Copy
5
40.03 40.02 40.01 40.04 40.05
 Sample output  Copy
40.01
 Tips 
 The diameter of the smallest ball is 40.01, So the answer is 40.01.

//
#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,i;
    double temp,ans;

    while( ~scanf("%d%lf",&n,&ans) )
    {
        for( i=0;i<n-1;i++ )
        {
            scanf("%lf",&temp);
            if( temp<ans ) ans=temp;
        }
        printf("%.2lf\n",ans);
    }
    return 0;
}