cf Round #634 (Div. 3)C题

C. Two Teams Composing
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
大致题意：给你n个人，第i个人拥有ai项技能，你需要组建俩支队伍，第一支所有队员的技能都不一样，第二支队员所有的技能都一样，并且第一支队伍的人数需要与第二支队伍的人数相同，请问最多每队能选几个人。
思路：遍历找出技能相同最多的人数，技能不同的人数，若技能相同的人数=技能不同的人数，则由于技能不同的人数包括了技能相同的人数的技能，所有要-1，若技能相同的人数多，则计算技能不同的人数，反之，计算技能不同的人数。

#include <iostream>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;

const int maxn = 2e5+10;
int a[maxn] = {0};
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n;
        scanf("%d", &n);
        memset(a, 0, sizeof(a));
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", &a[i]);
        }
        sort(a + 1, a + n + 1);
        int same = 1, maxn = 0;
        for(int i = 2; i <= n; )
        {
            if(a[i-1] == a[i])
            while(a[i-1] == a[i])//前== 后
            {
                i++;
                same++;
            }
            else
            {
                maxn = max(same, maxn);
                same = 1;
                i++;
            }
        }
        maxn = max(maxn, same);
        same = maxn;
        int uniqu;
        uniqu = unique(a + 1, a + n + 1) - (a + 1);
        if(n == 1)
            printf("0\n");
        else if(uniqu == same)
            printf("%d\n", same - 1);
        else if(uniqu > same)
            printf("%d\n", same);
        else//uniqu < same
        {
            printf("%d\n", uniqu);
        }
    }
    return 0;
}