maximum median

#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
 
long long A[200005];
int () {
 
    long long N, K;
    cin >> N >> K;

	for (int i = 1; i <= N;i++)
		cin >> A[i];

		sort(A+1,A+1+N);
    int mid = (N+1) / 2;
    long long current = A[mid];

	for (int i = mid + 1; i <= N; i++) {
		long long dis = A[i] - A[mid];
		if(K>=(i - mid) * dis)
		{
			K -= (i - mid) * dis;
			current += dis;
//			cout<<"------------"<<current<<endl; 
			A[mid] += dis;
		}
		else
		{
			current += K / (i-mid);
			K %= (i-mid);
			break;
		}
	}
 	if(K) current += K/(N-mid+1);
    cout << current << 'n';
}