题解

二分

#include <iostream>
#include <cstdio>
using namespace std;
int bucket[1005];
int n, m, x;
bool check(int x){//check
	int ct = 0;
	for(int i = 1; i <= 100; i++){
		ct += bucket[i] / x;
	}return ct >= m;
}
int main(){
	cin >> m >> n;
	for(int i = 1; i <= n; i++){
		cin >> x;
		bucket[x]++;//记录每种食物的个数
	}int left = 1, right = 100;
	while(left <= right){//二分模版
		int mid = (left + right) / 2;
		if(check(mid)) left = mid + 1;
		else right = mid - 1;
	}cout << left - 1;

	return 0;
}

时间复杂度：$O(nlog_2a_i)$