#include<bits/stdc++.h>

using namespace std;

long long n,k;

vector<long long>a;

bool kt(long long t)

{

long long h = 0;

for(int i = 0;i < n;i ++)

{

h += a[i]/t;

}

return h >= k;

}

int main()

{

cin >>n >>k;

a.resize(n);

long long l = 1,r = 0;

for(int i = 0;i < n;i ++)

{

cin >>a[i];

r = max(r,a[i]);

}

long long ans = 0;

while(l <= r)

{

long long mid = (l + r) / 2;

if(kt(mid))

{

ans = mid;

l = mid + 1;

}

else r = mid - 1;

}

cout <<ans;

}