大一十三周训练B题 规律题

大一十三周训练B题

这道题可通过数学思维分类讨论得出一个公式。
题目：
You are given an array aa of length nn consisting of integers. You can apply the following operation, consisting of several steps, on the array aa zero or more times:

you select two different numbers in the array aiai and ajaj;
you remove ii-th and jj-th elements from the array.
For example, if n=6n=6 and a=[1,6,1,1,4,4]a=[1,6,1,1,4,4], then you can perform the following sequence of operations:

select i=1,j=5i=1,j=5. The array aa becomes equal to [6,1,1,4][6,1,1,4];
select i=1,j=2i=1,j=2. The array aa becomes equal to [1,4][1,4].
What can be the minimum size of the array after applying some sequence of operations to it?
输入：
The first line contains a single integer tt (1≤t≤1041≤t≤104). Then tt test cases follow.

The first line of each test case contains a single integer nn (1≤n≤2⋅1051≤n≤2⋅105) is length of the array aa.

The second line of each test case contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109).

It is guaranteed that the sum of nn over all test cases does not exceed 2⋅1052⋅105.
输出：
For each test case, output the minimum possible size of the array after applying some sequence of operations to it.
样例：
输入：
5
6
1 6 1 1 4 4
2
1 2
2
1 1
5
4 5 4 5 4
6
2 3 2 1 3 1
输出：
0
0
2
1
0
————————————————————————————————————
题意：
给你一个已知长度的数列，让你选出任意两个不相等的数并删除，重复这个操作，直至没法删除后，输出该数列还剩几个元素。
思路：
刚开始在想着怎样排序，结果不管怎么排都无法找到普遍规律；于是百度了下，大佬解释的是可以用优先队列每次都挑出出现最多的那个数；听到这里，我就有思路了，那就先记录每一个元素的个数；让后用数学的分类思想，首先分为偶数个和奇数个，偶数个就不说了，奇数个到最后至少剩下一个元素；接着细分就能找到规律。
——————————————————————————————————
代码来啦：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
long long a[200010],book[200010];
int main()
{
    long long t,i,j,sum,k,n,maxx;
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld",&n);
        for(i=1;i<=n;i++)
        {
            scanf("%lld",&a[i]);
        }
        sort(a+1,a+1+n);
        sum=0;
        k=1;
        maxx=0;
        for(i=2;i<=n;i++)
        {
            if(a[i]==a[i-1])
            {
                k++;
            }
            else
            {
                maxx=max(maxx,k);
                k=1;
            }
        }
        maxx=max(maxx,k);
        sum=maxx-(n-maxx);
        if(sum<0)
            sum=0;
        if(n%2==1&&!sum)
            sum=1;
        printf("%lld\n",sum);
    }
    return 0;
}