# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
165503 | 2019-11-27T11:40:53 Z | itiam | Prosjek (COCI18_prosjek) | C++11 | 2 ms | 424 KB |
#include <ctime> #include <cstdio> #include <iostream> #include <algorithm> using namespace std; int main() { int N; double L[22],x; cin >> N; for (int i=0;i<N;i++){ cin >> x; L[i]=x; } sort(L,L+N); //ispis(L,N); double a,b; int y; for (int i=0;i<N-1;i++){ a=L[i]; b=L[i+1]; L[i+1]=(a+b)/2.0; y=i+1; } cout << L[y]; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 252 KB | Output is correct |
4 | Correct | 2 ms | 348 KB | Output is correct |
5 | Correct | 2 ms | 348 KB | Output is correct |
6 | Correct | 2 ms | 424 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 380 KB | Output is correct |
9 | Correct | 2 ms | 360 KB | Output is correct |
10 | Correct | 2 ms | 364 KB | Output is correct |