#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T, greater<T>>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 2e5 + 5;
int n;
int hmm1[mx];
int hmm2[mx];
multiset<int> st;
vector<int> cnt[mx];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int q;
  cin >> q;
  while (q--) {
    st.clear();
    cin >> n;
    for (int i = 0; i <= n + 2; ++i) {
      hmm1[i] = hmm2[i] = 0;
      cnt[i].clear();
    }
    for (int i = 0; i < n; ++i) {
      int a, f;
      cin >> a >> f;
      ++hmm1[a];
      hmm2[a] += f;
    }
    for (int i = 1; i <= n; ++i) {
      cnt[hmm1[i]].push_back(hmm2[i]);
    }
    long long ans1 = 0, ans2 = 0;
    for (int i = n; i >= 1; --i) {
      for (auto x : cnt[i]) st.insert(x);
      if (!st.empty()) {
        ans1 += i;
        ans2 += min(i, *st.rbegin());
        auto itr = st.end();
        --itr;
        st.erase(itr);
      }
    }
    cout << ans1 << " " << ans2 << '\n';
  }
}
