[Algorithm] BOJ 1546

#include <iostream>
using namespace std;

int main()
{
    double n,sum = 0, tmp = 0, large = 0, newV;
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cin >> tmp;
        if(i == 0)
        {
            large = tmp;
            sum += tmp;
        }
        else
        {
            sum += tmp;
            if(tmp >= large)
                large = tmp;
        }
    }
    newV = sum/large*100;
    newV /= n;
    cout << newV;
    return 0;
}