#include <iostream>
#include <fstream>

using namespace std;

ifstream f ("grupuri.in");
ofstream g ("grupuri.out");

#define nmax 100000000000
#define maxn 100000

int n,k,v[maxn],i;

int check (long long n)
{
    int i,s=0;
    for (i=0;i<n;i++)
         if(v[i]>n)
            s+=n;
         else
            s+=v[i];
     if(s<n*k)
        return 0;
     return 1;
}

long long bin_search()
{
    long long i, step=1<<30;
    for (i=0;step;step>>=1)
      if(i+step<nmax && check(step))
      i+=step;
    return i;

}
int main()
{
    f>>n>>k;
    for (i=0;i<n;i++)
        f>>v[i];
    g<<bin_search();
    f.close();
    g.close();
    return 0;
}