#include<bits/stdc++.h>
using namespace std;
void solve(){
}
int main() {
int n;
cin>>n;
vector<double>v1(n),v2;
for (int i = 0; i <n ; ++i) {
cin>>v1[i];
}
sort(v1.begin(),v1.end());
double ans=v1[0];
for (int i = 1; i <n ; ++i) {
ans=(ans+v1[i])/2;
}
cout<<fixed<<setprecision(6)<<ans<<endl;
return 0;
}
// QAQGDQAQhdfj
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
296 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
256 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |