#include<bits/stdc++.h> using namespace std; const int N=1e6+10; int n,m,a[N],i,maxn=-1; int check(int mid){ int cnt=0; for(i=1;i<=n;i++){ if(a[i]>=mid){ cnt+=a[i]/mid; } } return cnt; } int main(){ cin>>n; for(i=1;i<=n;i++){ cin>>a[i]; maxn=max(maxn,a[i]); } cin>>m; int left=1,right=maxn,mid; while(left<=right){ mid=left+(right-left)/2; if(check(mid)>=m){ left=mid+1; }else{ right=mid-1; } } cout<<right; }