#include<iostream>
#include<algorithm>
const long long maxn=1e5;
long long n,k,a[maxn];
bool p(long long x)
{
    long long sum=0,i,t;
    for(i=0;i<n;i++)
    {
        t=a[i];
        while(t>=x)
        {
            t-=x;sum++;
        }
    }
   return sum>=k;
}
using namespace std;
int main()
{
    cin>>n>>k;
    long long l,r,ans=0,mid,i;
    for(i=0;i<n;i++)
      cin>>a[i];
    l=0;r=1e8;
      while(l<r)
      {
          mid=l+(r-l)/2;
          if(p(mid))
          {ans=mid;l=mid+1;}
          else r=mid-1;
      }
      cout<<ans;
 return 0;
}

开了O2过了，没开O2就TLE。萌新刚入门，不太懂。复杂度不是nlogn么