1183D.md (2151B)
1 Source: https://codeforces.com/problemset/problem/1183/D 2 3 D. Candy Box (easy version) 4 5 time limit per test 6 7 3 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 This problem is actually a subproblem of problem G from the same contest. 22 23 There are $n$ candies in a candy box. The type of the $i$-th candy is $a_i$ ($1 \le a_i \le n$). 24 25 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). 26 27 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. 28 29 Your task is to find out the maximum possible size of the single gift you can prepare using the candies you have. 30 31 You have to answer $q$ independent queries. 32 33 If you are Python programmer, consider using PyPy instead of Python when you submit your code. 34 35 Input 36 37 The first line of the input contains one integer $q$ ($1 \le q \le 2 \cdot 10^5$) — the number of queries. Each query is represented by two lines. 38 39 The first line of each query contains one integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the number of candies. 40 41 The second line of each query contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le n$), where $a_i$ is the type of the $i$-th candy in the box. 42 43 It is guaranteed that the sum of $n$ over all queries does not exceed $2 \cdot 10^5$. 44 45 Output 46 47 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. 48 49 Example 50 51 Input 52 53 ``` 54 3 55 8 56 1 4 8 4 5 6 3 8 57 16 58 2 1 3 3 4 3 4 4 1 3 2 2 2 4 1 1 59 9 60 2 2 4 4 4 7 7 7 7 61 ``` 62 63 Output 64 65 ``` 66 3 67 10 68 9 69 ``` 70 71 Note 72 73 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. 74 75 Note that this is not the only possible solution — taking two candies of type $4$ and one candy of type $6$ is also valid.