# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
132190 | 2019-07-18T12:30:45 Z | robs | Prosjek (COCI18_prosjek) | C++14 | 2 ms | 380 KB |
#include <bits/stdc++.h> using namespace std; const int maxn=7654321; int n; float v[maxn]; int main(){ scanf("%d",&n); for(int x=0;x<n;x++){ scanf("%f",&v[x]); } sort(v,v+n); for(int x=1;x<n;x++){ v[x]=(v[x]+v[x-1])/2; } printf("%.6f",v[n-1]); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 380 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 296 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |