妮妮的月饼工厂

#include<bits/stdc++.h>
using namespace std;
#define ll long long 
const int N = 1e6;
int n,k,a[N];
bool check(int x) {
  int num = 0;
  for(int i = 0; i < n; i ++) {
    num += a[i] / x;
  }
  return num >= k;
}
int main() {
  cin>>n>>k;
  for(int i = 0; i < n; i ++) cin>>a[i];
    int l = 0,r = 1e9+1;
    while(l + 1 != r) {
      ll mid = (l + r) >> 1;
      if(check(mid)) l = mid;
      else r = mid;
    }
  if(l == 0) cout<<-1;
  else cout<<l;
}