#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define forr(i,a) for(auto i:a)
#define rall(a) rbegin(a),rend(a)
#define all(a) begin(a),end(a)
#define pb emplace_back
using namespace std;
struct read
{
    static const int M = 1 << 23;
    char buf[M], *S = buf, *P = buf, c, l;
    inline char gc() { return (S == P && (P = (S = buf) + fread(buf, 1, M, stdin), S == P) ? EOF : *S++); }
    template<class T> read &operator>>(T &x)
    {
        for (c = 0;!isdigit(c);c = gc()) l = c;
        for (x = 0;isdigit(c);c = gc()) x = x * 10 + (c & 15);
        return x = (l ^ 45) ? x : -x, *this;
    }
}Cin;

void solve()
{
    double s1 = 0, s2 = 0;
    int n; Cin >> n;
    rep(i, 1, n)
    {
        int x; Cin >> x;
        if (s1 < 100) s1 += x;
        else if (s1 >= 100 && s1 < 200) s1 += x * 0.8;
        else s1 += x * 0.5;
        s2 += x;
    }
    if (s2 >= 100) s2 = 100 + (s2 - 100) * 0.8;
    if (s2 >= 200) s2 = 200 + (s2 - 200) / 0.8 * 0.5;
    cout << fixed << setprecision(3) << s2 << ' ' << s1 << '\n';
}
signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int _;for (Cin >> _; _--; ) solve();
    return 0;
}