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
Input
4
7
4 2 4 1 4 3 4
5
2 1 5 4 3
1
1
4
1 1 1 3
Output
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.
思路：我们求出一共有多少种数字x，并且求出这些数字中个数最多的一种是多少个，假设是y个。除去这一种，还剩x-1种数字。在x-1和y中取个最小值。然后如果y比x-1多2的话，说明y还可以分一个出去，那么最终答案再增加一个。
代码如下：
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxx=2e5+100;
int a[maxx];
int vis[maxx];
int n;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++) vis[i]=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]),vis[a[i]]++;
int _max=0;
int _min=0;
for(int i=1;i<=n;i++)
{
_max=max(_max,vis[i]);
if(vis[i]!=0) _min++;
}
_min-=1;
int ans=min(_min,_max);
if(_max-ans>=2) ans++;
cout<<ans<<endl;
}
return 0;
}
努力加油a啊，(o)/~
