#include <algorithm>

 #include <cstdio>

 inline void read(int &x)

 {

     x=; register char ch=getchar();;

     for(; ch>''||ch<''; ) ch=getchar();

     for(; ch>=''&&ch<=''; ch=getchar()) x=x*+ch-'';

 }

 int n,m,a[];

 int L,R,Mid,ans;

 inline bool check(int x)

 {

     int cnt=;

     for(int i=n; i; --i)

     {

         if(cnt>=m) return ;

         cnt+=a[i]/x;

     }

     return false;

 }

 int Presist()

 {

     read(n),read(m);

     for(int i=; i<=n; ++i) read(a[i]);

     std:: sort(a+,a+n+);

     for(R=a[n]; L<=R; )

     {

         Mid=L+R>>;

         if(check(Mid))

         {

             ans=Mid;

             L=Mid+;

         }

         else R=Mid-;

     }

     printf("%d\n",ans);

     return ;

 }

 int Aptal=Presist();

 int main(int argc,char**argv){;}