标准题解

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n,m;
int a[N];
bool check(int mid){
	int num = 0;
	for (int i = 0;i < n;i++){
		num += a[i] / mid; 
	}
	if (num >= m){
		return true;
	}
	return false;
}
int main(){
	cin>>n>>m;
	int l = 0,r = 0 ;
	for (int i = 0;i < n;i++){
		cin>>a[i];
		r = max(r,a[i]);
	}
	while(l < r){
		int mid = l + r + 1 >> 1;
		if (check(mid)) l = mid;
		else r = mid - 1;
	}
	cout<<l;	
	return 0;
}