DSA03009 - SẮP XẾP CÔNG VIỆC 2

//Made By Phuong Nam PROPTIT <3//
#pragma GCC Optimize("O3")
#include<bits/stdc++.h>
#include<string>
#include<vector>
#define alphaa "abcdefghijklmnopqrstuvwxyz"
#define ALPHAA "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define f(i,a,b) for(int i=a;i<=b;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define f0(i,n) for(int i=0;i<n;i++)
#define ff(i,b,a) for(int i=b;i>=a;i--)
#define el cout<<'\n'
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(s) s.begin(),s.end()
using namespace std;
typedef long long ll;
const int N=1e6+3;
const int MOD=1e9+7;
template<class X,class Y>
    void minimize(X &x,const Y &y) {
        if (x>y) x=y;
    }
template<class X,class Y>
    void maximize(X &x,const Y &y) {
        if (x<y) x=y;
    }
template<class T>
    T Abs(const T &x) {
        return (x<0?-x:x);
    }
struct node
{
    int id,fin,sen;
}a[N];
int n,f[1005];
bool ss(node a,node b)
{
    return a.sen>b.sen;
}
void xuly()
{
    memset(f,0,sizeof(f));
    cin>>n;
    f1(i,n) cin>>a[i].id>>a[i].fin>>a[i].sen;
    sort(a+1,a+n+1,ss);
    int dem=0,res=0;
    f1(i,n)
    {
        while(f[a[i].fin]&&a[i].fin) a[i].fin--;
        if(!f[a[i].fin]&&a[i].fin)
        {
            f[a[i].fin]=1;
            dem++;
            res+=a[i].sen;
        }
    }
    cout<<dem<<' '<<res;
    el;
}
int main()
{
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int t=1;
  cin>>t;
  while(t--) xuly();
  return 0;
}
//-----YEU CODE HON CRUSH-----//