#include <bits/stdc++.h>
using namespace std;
// https://space.bilibili.com/672346917

#ifndef LOCAL
#define LOG(...) 42
#endif

#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

typedef long long LL;
typedef pair <int, int> PII;

constexpr int inf = 0x3f3f3f3f;
constexpr double EPS = 1e-10;
const double PI = acos(-1);

int multi_cases = 1;

bool ge(double a, double b) {
    return a - b > EPS || fabs(a - b) < EPS;
}

void A_SOUL_AvA () {
    int n;
    cin >> n;
    vector <double> a(n);

    double now = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (ge(now, 200)) {
            now += 0.5 * a[i];
        } else if (ge(now, 100)) {
            now += 0.8 * a[i];
        } else {
            now += a[i];
        }
    }

    double tot = 0;
    for (int i = 0; i < n; i++) {
        if (ge(tot, 200)) {
            tot += 0.5 * a[i];
        } else if (ge(tot, 100)) {
            // >= 100
            double diff = (200 - tot) * 4 / 5.;
            if (ge(a[i], diff)) {
                tot += diff * 0.8;
                a[i] -= diff;
                i--;
            } else {
                tot += a[i] * 0.8;
            }
        } else {
            // < 100
            double diff = (100 - tot);
            if (ge(a[i], diff)) {
                tot += diff;
                a[i] -= diff;
                i--;
            } else {
                tot += a[i];
            }
        }
    }

    cout << tot << " " << now << endl;
}

int main () {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(3);

    int T = 1;
    for (multi_cases && cin >> T; T; T--) {
        A_SOUL_AvA ();
    }

    return 0;
}