每日一题第二十六期 Codeforces Round 936 (Div. 2)

最新推荐文章于 2024-09-13 16:27:15 发布

娇娇yyyyyy

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量792

点赞数 20

分类专栏：每日一题文章标签：算法 c++

本文链接：https://blog.csdn.net/2301_80882026/article/details/136961807

版权

每日一题专栏收录该内容

97 篇文章 1 订阅

订阅专栏

A. Median of an Array

time limit per test: 1 second

memory limit per test: 256 megabytes

input: standard input

output: standard output

You are given an array $a$ of $n$ integers.

The median of an array $q_1, q_2, \ldots, q_k$ is the number $p_{\lceil \frac{k}{2} \rceil}$ , where $p$ is the array $q$ sorted in non-decreasing order. For example, the median of the array $[9, 5, 1, 2, 6]$ is $5$ , as in the sorted array $[1, 2, 5, 6, 9]$ , the number at index $\lceil \frac{5}{2} \rceil = 3$ is $5$ , and the median of the array $[9, 2, 8, 3]$ is $3$ , as in the sorted array $[2, 3, 8, 9]$ , the number at index $\lceil \frac{4}{2} \rceil = 2$ is $3$ .

You are allowed to choose an integer $i$ ( $\le i \le n$ ) and increase $a_i$ by $1$ in one operation.

Your task is to find the minimum number of operations required to increase the median of the array.

Note that the array $a$ may not necessarily contain distinct
numbers.
Input

Each test consists of multiple test cases. The first line contains a single integer $t$ ( $\le t \le 10^4$ ) — the number of test cases. Then follows the description of the test cases.

The first line of each test case contains a single integer $n$ ( $\le n \le 10^5$ ) — the length of the array $a$ .

The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $\le a_i \le 10^9$ ) — the array $a$ .

It is guaranteed that the sum of the values of $n$ over all test cases does not exceed $\cdot 10^5$ .

Output

For each test case, output a single integer — the minimum number of operations required to increase the median of the array.

Example
inputCopy
8
3
2 2 8
4
7 3 3 1
1
1000000000
5
5 5 5 4 5
6
2 1 2 3 1 4
2
1 2
2
1 1
4
5 5 5 5
outputCopy
1
2
1
3
2
1
2
3

Note

In the first test case, you can apply one operation to the first number and obtain the array $[3, 2, 8]$ , the median of this array is $3$ , as it is the number at index $\lceil \frac{3}{2} \rceil = 2$ in the non-decreasing sorted array $[2, 3, 8]$ . The median of the original array $[2, 2, 8]$ is $2$ , as it is the number at index $\lceil \frac{3}{2} \rceil = 2$ in the non-decreasing sorted array $[2, 2, 8]$ . Thus, the median increased ( $KaTeX parse error: Expected 'EOF', got '&' at position 3: 3 &̲gt; 2$ ) in just one operation.

In the fourth test case, you can apply one operation to each of the numbers at indices $1, 2, 3$ and obtain the array $[6, 6, 6, 4, 5]$ , the median of this array is $6$ , as it is the number at index $\lceil \frac{5}{2} \rceil = 3$ in the non-decreasing sorted array $[4, 5, 6, 6, 6]$ . The median of the original array $[5, 5, 5, 4, 5]$ is $5$ , as it is the number at index $\lceil \frac{5}{2} \rceil = 2$ in the non-decreasing sorted array $[4, 5, 5, 5, 5]$ . Thus, the median increased ( $KaTeX parse error: Expected 'EOF', got '&' at position 3: 6 &̲gt; 5$ ) in three operations. It can be shown that this is the minimum possible number of operations.

In the fifth test case, you can apply one operation to each of the numbers at indices $1, 3$ and obtain the array $[3, 1, 3, 3, 1, 4]$ , the median of this array is $3$ , as it is the number at index $\lceil \frac{6}{2} \rceil = 3$ in the non-decreasing sorted array $[1, 1, 3, 3, 3, 4]$ . The median of the original array $[2, 1, 2, 3, 1, 4]$ is $2$ , as it is the number at index $\lceil \frac{6}{2} \rceil = 3$ in the non-decreasing sorted array $[1, 1, 2, 2, 3, 4]$ . Thus, the median increased ( $KaTeX parse error: Expected 'EOF', got '&' at position 3: 3 &̲gt; 2$ ) in two operations. It can be shown that this is the minimum possible number of operations.

AC代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
#include<iomanip>
#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=998244353;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e6 + 10;

int t;
int n;
int a[N];
int main()
{
	cin >> t;
	while(t --){
		int n;
		cin >> n;
		for(int i = 1; i <= n; i++)
		{
			cin >> a[i];
		}
		sort(a + 1, a + 1 + n);
		if(n & 1)
		{
			int cnt = 1;
			for(int i = (n + 1) / 2; i <= n; i ++)
			{
				if(a[i] == a[i + 1] && i != n) cnt ++ ;
				else break;
			}
			cout << cnt << endl;
		}
		else {
			int cnt = 1;
			for(int i = n / 2; i <= n; i ++)
			{
				if(a[i] == a[i + 1] && i != n) cnt ++;
				else break;
			}
			cout << cnt << endl;
		}
	}
	return 0;
}