超级压缩

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