Codeforces Round #570 (Div. 3) D （贪心）

Candy Box (easy version)

time limit per test: 3 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

This problem is actually a subproblem of problem G from the same contest.

There are n candies in a candy box. The type of the i-th candy is ai (1≤ai≤n).

You have to prepare a gift using some of these candies with the following restriction: the numbers of candies of each type presented in a gift should be all distinct (i. e. for example, a gift having two candies of type 1 and two candies of type 2 is bad).

It is possible that multiple types of candies are completely absent from the gift. It is also possible that not all candies of some types will be taken to a gift.

Your task is to find out the maximum possible size of the single gift you can prepare using the candies you have.

You have to answer q independent queries.

If you are Python programmer, consider using PyPy instead of Python when you submit your code.

Input

The first line of the input contains one integer q (1≤q≤2⋅105) — the number of queries. Each query is represented by two lines.

The first line of each query contains one integer n (1≤n≤2⋅105) — the number of candies.

The second line of each query contains n integers a1,a2,…,an (1≤ai≤n), where ai is the type of the i-th candy in the box.

It is guaranteed that the sum of n over all queries does not exceed 2⋅105.

Output

For each query print one integer — the maximum possible size of the single gift you can compose using candies you got in this query with the restriction described in the problem statement.

Example

Input

3
8
1 4 8 4 5 6 3 8
16
2 1 3 3 4 3 4 4 1 3 2 2 2 4 1 1
9
2 2 4 4 4 7 7 7 7

Output

3
10
9

Note

In the first query, you can prepare a gift with two candies of type 8 and one candy of type 5, totalling to 3 candies.

Note that this is not the only possible solution — taking two candies of type 4 and one candy of type 6 is also valid.

先贴代码，改天补上题解：

    #include<cstdio>
    #include<map>
    #include<algorithm>
    using namespace std;
    const int maxn = 2e5 + 5;
    bool cmp(int x, int y)
    {
        return x > y;
    }
    int sum[maxn];
    map<int, int> a;
    int main()
    {
        int t;
        int n;
        scanf("%d", &t);
        while(t--)
        {
            a.clear();
            scanf("%d", &n);
            for(int i = 0;i < n; ++i)
            {
                int p;
                scanf("%d", &p);
                a[p]++;
            }
            map<int, int>::iterator it;
            int cal = 0;
            for(it = a.begin(); it != a.end(); ++it)
            {
                sum[cal++] = it->second;
            }
            sort(sum, sum + cal, cmp);
            int pre = sum[0];
            int tol = sum[0];
            for(int i = 1;i < cal; ++i)
            {
                pre = min(pre - 1, sum[i]);
                if(pre == 0)
                {
                    break;
                }
                tol += pre;
            }
            printf("%d\n", tol);
        }
        return 0;
    }