lunchtimeaug22---.cpp

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

int maxFreq(long long int arr[], int n)
{
    sort(arr, arr + n);

    int max_count = 1, res = arr[0], curr_count = 1;
    for (int i = 1; i < n; i++)
    {
        if (arr[i] == arr[i - 1])
            curr_count++;
        else
            curr_count = 1;

        if (curr_count > max_count)
        {
            max_count = curr_count;
            res = arr[i - 1];
        }
    }

    return max_count;
}

int main()
{
    int t;
    cin >> t;

    while (t--)
    {
        int n;
        cin >> n;

        long long int arr[n];

        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
        }

        int j = maxFreq(arr, n);

        if (j <= (n + 1) / 2)
        {
            cout << "Yes" << endl;
        }
        else
        {
            cout << "No" << endl;
        }
    }
}