# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1204337 | arturraa | Prosjek (COCI18_prosjek) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
void scan(int &number){
bool negative = false;
register int c;
number = 0;
c = getchar();
if (c=='-') {
negative = true;
c = getchar();
}
for (; (c>47 && c<58); c=getchar())
number = number *10 + c - 48;
if (negative)
number *= -1;
}
#define umap unordered_map<int,int>
#define pq priority_queue<int>
#define ll long long int
#define ull unsigned long long int
#define maxn 1000000000
#define inf 2000000000
#define minf -2000000000
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// codigo aqui
int N;
scan(N);
vector<int> V(N);
for (int i = 0; i < N; i++) scan(V[i]);
sort(V.begin(), V.end());
double M = V[0];
for (int i = 1; i < N; i++) M = (M + V[i])/2;
cout << M;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |