D. Candy Box (easy version)

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.

题意： 大意:q qq次询问，每次询问给出n nn个数，让你从这给数列找一组数，使得没有出现相同次数的两种数，问最多多少个。

贪心模拟

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
const int maxn = 2e5+100;
int dis[maxn];
int cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int i,j;
        for(i=0; i<=n; i++)
            dis[i] = 0;
        for(i=1; i<=n; i++)
        {
            int x;
            scanf("%d",&x);
            dis[x]++;
        }
        long long ans = 0;
        sort(dis+1,dis+n+1,cmp);
        ans +=dis[1];
        int pre = dis[1];
        for(i=2; i<=n; i++)
        {
            if(dis[i]==0||pre==0)
                break;
            if(dis[i]>=pre)
            {
                if(pre==0)
                    break;
                ans +=pre-1;
                pre = pre-1;
            }
            else
            {
                ans +=dis[i];
                pre = dis[i];
            }

        }
        printf("%lld\n",ans);
    }
    return 0;
}