#634 (Div. 3)Two Teams Composing(桶排序)

题目分析：

You have n students under your control and you have to compose exactly two teams consisting of some subset of your students. Each student had his own skill, the i-th student skill is denoted by an integer ai (different students can have the same skills).
So, about the teams. Firstly, these two teams should have the same size. Two more constraints:
The first team should consist of students with distinct skills (i.e. all skills in the first team are unique).
The second team should consist of students with the same skills (i.e. all skills in the second team are equal).
Note that it is permissible that some student of the first team has the same skill as a student of the second team.
Consider some examples (skills are given):
[1,2,3], [4,4] is not a good pair of teams because sizes should be the same;
[1,1,2], [3,3,3] is not a good pair of teams because the first team should not contain students with the same skills;
[1,2,3], [3,4,4] is not a good pair of teams because the second team should contain students with the same skills;
[1,2,3], [3,3,3] is a good pair of teams;
[5], [6] is a good pair of teams.
Your task is to find the maximum possible size x for which it is possible to compose a valid pair of teams, where each team size is x (skills in the first team needed to be unique, skills in the second team should be the same between them). A student cannot be part of more than one team.
You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.
The first line of the test case contains one integer n (1≤n≤2⋅105) — the number of students. The second line of the test case contains n integers a1,a2,…,an (1≤ai≤n), where ai is the skill of the i-th student. Different students can have the same skills.
It is guaranteed that the sum of n over all test cases does not exceed 2⋅105 (∑n≤2⋅105).

Output

For each test case, print the answer — the maximum possible size x for which it is possible to compose a valid pair of teams, where each team size is x.

Example

inputCopy
4
7
4 2 4 1 4 3 4
5
2 1 5 4 3
1
1
4
1 1 1 3
outputCopy
3
1
0
2

Note

In the first test case of the example, it is possible to construct two teams of size 3: the first team is [1,2,4] and the second team is [4,4,4]. Note, that there are some other ways to construct two valid teams of size 3.

这道题做的时候看错了数据范围结果导致了TLE，最后也没做出来，又掉分了。。。。

题目分析：

这个题就是一个简单的桶排序应用。用桶排序来统计数的类型cnt和相同数的最大数目k即可。
然后，计算队伍最大的人数。

1. cnt>k时，队伍的最大人数即为k。
2. cnt<=k时，可以把k对应的数中的一个移到一队中，即队伍最大人数为max(k-1,cnt)。

代码如下

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <queue>
#include <algorithm>
#include <iomanip>
#define LL long long
using namespace std;
const int N=2e5+1;
int a[N];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		memset(a,0,sizeof a);
		int n;
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			int x;
		    scanf("%d",&x);
		    a[x]++;
		}
		int cnt=0,k=0;
		for(int i=1;i<=n;i++)
		{
			if(a[i]>0) cnt++;
			k=max(k,a[i]);
		}
		if(cnt>k) printf("%d\n",k);
		else printf("%d\n",min(k-1,cnt));
	}
	return 0;
}