#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a;
cin >> n;
deque<float> arr (n,0);
for (int i = 0; i < n ; i++){
cin >> a;
arr[i] = a;
}
//cout << arr[1] << ' ';
sort(arr.begin(),arr.end());
//cout << arr[1] << ' ';
float k;
for (int j = 0; j < n - 1; j++){
k = (arr[1] + arr[0])/2;
arr[1] = k;
arr.pop_front();
}
cout << arr[0];
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |