#include using namespace std; using ll=long long; struct yuri { ll num,den; yuri() : num(0),den(1) {} yuri(ll a) : num(a),den(1){} yuri(ll a,ll b) : num(a),den(b){safe();} void safe(){ //if(den<0)den*=-1,num*=-1; //ll v=__gcd(abs(num),den); //num/=v,den/=v; } yuri& operator++() {num+=den;return *this;} yuri& operator--() {num-=den;return *this;} yuri& operator+=(const yuri& rhs) { num=num*rhs.den+den*rhs.num; den=den*rhs.den; safe(); return *this; } yuri& operator-=(const yuri& rhs) { num=num*rhs.den-den*rhs.num; den=den*rhs.den; safe(); return *this; } yuri& operator*=(const yuri& rhs) { num=num*rhs.num; den=den*rhs.den; safe(); return *this; } yuri& operator/=(const yuri& rhs) { num=num*rhs.den; den=den*rhs.num; safe(); return *this ; } yuri operator+() const { return *this; } yuri operator-() const { return yuri() - *this; } friend yuri operator+(const yuri& lhs, const yuri& rhs) { return yuri(lhs) += rhs; } friend yuri operator-(const yuri& lhs, const yuri& rhs) { return yuri(lhs) -= rhs; } friend yuri operator*(const yuri& lhs, const yuri& rhs) { return yuri(lhs) *= rhs; } friend yuri operator/(const yuri& lhs, const yuri& rhs) { return yuri(lhs) /= rhs; } friend bool operator==(const yuri& lhs, const yuri& rhs) { return (lhs.num==rhs.num&&lhs.den==rhs.den); } friend bool operator!=(const yuri& lhs, const yuri& rhs) { return (lhs.num!=rhs.num||lhs.den!=rhs.den); } friend bool operator<(const yuri& lhs, const yuri& rhs) { return (lhs.num*rhs.den(const yuri& lhs, const yuri& rhs) { return (lhs.num*rhs.den>lhs.den*rhs.num); } friend bool operator>=(const yuri& lhs, const yuri& rhs) { return (lhs.num*rhs.den>=lhs.den*rhs.num); } friend ostream& operator << (ostream &os, const yuri& rhs) noexcept { if(rhs.den==1)return os << rhs.num; return os << rhs.num << '/' << rhs.den; } }; int main(){ int n, q; cin >> n; vector l(n); priority_queue pq; for(auto &&v: l){ cin >> v; pq.push(v); } cin >> q; vector> Q(q); vector ans(q); for(int i = 0; i < q; i++){ cin >> Q[i].first; Q[i].second = i; } sort(l.rbegin(), l.rend()); sort(Q.begin(), Q.end()); yuri p = 1ll << 60; for(int i = 0, j = 1, cnt = 0; i < q; i++){ while(cnt < Q[i].first){ auto q = pq.top(); p = min(p, pq.top()); q.den++; pq.pop(); pq.push(q); cnt++; } ans[Q[i].second] = double(p.num) / p.den; } for(int i = 0; i < q; i++){ printf("%.15lf\n",ans[i]); } }