#include"bits/stdc++.h"

 #define db double

 #define ll long long

 #define vl vector<ll>

 #define ci(x) scanf("%d",&x)

 #define cd(x) scanf("%lf",&x)

 #define cl(x) scanf("%lld",&x)

 #define pi(x) printf("%d\n",x)

 #define pd(x) printf("%f\n",x)

 #define pl(x) printf("%lld\n",x)

 #define rep(i, a, n) for (int i=a;i<n;i++)

 #define per(i, a, n) for (int i=n-1;i>=a;i--)

 #define fi first

 #define se second

 using namespace std;

 typedef pair<int, int> pii;

 const int N = 1e5 + ;

 const int mod = 1e9 + ;

 const int MOD = ;

 const db PI = acos(-1.0);

 const db eps = 1e-;

 const int inf = 0x3f3f3f3f;

 const ll INF = 0x3fffffffffffffff;

 int n;

 struct P {

     int x, id;

     P(int a, int b) : x(a), id(b) {};

     bool operator<(const P &a) const {

         if (x == a.x) return id < a.id;//反向重载

         return x > a.x;

     }

 };

 int main() {

     int T;

     ci(T);

     while (T--) {

         ci(n);

         priority_queue<P> q;

         ll ans = , cnt = ;

         for (int i = , x; i < n; i++) {

             ci(x);

             if (!q.empty() && q.top().x < x) {

                 P tmp = q.top();q.pop();

                 ans += x - tmp.x;

                 if (!tmp.id) cnt++;

                 q.push(P(x, ));//以x的价格卖出过,以后可能还会以更高的价格卖

             }

             q.push(P(x, ));//要以x的价格买入

         }

         printf("%lld %lld\n", ans,  * cnt);

     }

     return ;

 }