1201C C. Maximum Median

最新推荐文章于 2021-01-19 13:57:41 发布

dream_it_

最新推荐文章于 2021-01-19 13:57:41 发布

阅读量807

点赞数 1

分类专栏： codeforces 文章标签：二分

本文链接：https://blog.youkuaiyun.com/dream_it_/article/details/98511000

版权

给定一个奇数长度的整数数组，允许最多k次操作，每次选择一个元素加1，目标是使数组排序后的中位数最大化。通过先排序数组，然后从中位数开始使用二分搜索确定最大可能的增加次数，从而找到最大中位数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

						C. Maximum Median
						time limit per test2 seconds
						memory limit per test256 megabytes
						inputstandard input
						outputstandard output

You are given an array a of n integers, where n is odd. You can make the following operation with it:

Choose one of the elements of the array (for example ai) and increase it by 1 (that is, replace it with ai+1).
You want to make the median of the array the largest possible using at most k operations.

The median of the odd-sized array is the middle element after the array is sorted in non-decreasing order. For example, the median of the array [1,5,2,3,5] is 3.

Input
The first line contains two integers n and k (1≤n≤2⋅105, n is odd, 1≤k≤109) — the number of elements in the array and the largest number of operations you can make.

The second line contains n integers a1,a2,…,an (1≤ai≤109).

Output
Print a single integer — the maximum possible median