#include <cstdio> #include <algorithm> int n; long long k; int L[100010]; bool check(int x) { long long len = 0; for(int i = 1; i <= n; i++) len += L[i] / x; return len >= k; } int main() { scanf("%d %lld", &n, &k); for(int i = 1; i <= n; i++) scanf("%d", &L[i]); int l = 1, r = 1e9; while(l < r) { int mid = (l + r + 1) >> 1; if(check(mid)) l = mid; else r = mid - 1; } if(!check(1)) puts("0"); else printf("%d", l); return 0; }