AsEasyAsABC

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    short int n,k;
    cin>>n>>k;
    short int a[n];
    for(short int i=0;i<n;++i)
        cin>>a[i];
    sort(a,a+n);
    short int p=0;
    for(short int i=n/2+1;i<n;++i)
        if(a[n/2]!=a[i])
        {
            p=i-1;
            break;
        }
    if(p-n/2+1<=k)
        ++a[n/2];
    cout<<a[n/2];
    return 0;
}