1011B - Planning The Expedition - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
template<class T>
bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; }
template<class T>
bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }

typedef long long ll;
bool check(int mid, map<int, int>&freq, int n){
    if(mid==0) return false;
    int cnt=0;
    for(auto p:freq)
        cnt+=(p.second/mid);
    return cnt>=n;
}
void TT() {
    int n, m;
    cin>>n>>m;
    map<int, int>freq;
    for(int i=0;i<m;i++){
        int type;
        cin>>type;
        freq[type]++;
    }
    int st=0, e=100, mid, ans=0;
    while(st<=e){
        mid=(st+e+1)/2;
        if(check(mid, freq, n)){
            st=mid+1;
            ans=mid;
        }
        else e=mid-1;
    }
    cout<<ans<<'\n';
}
int main() {
    FAST
    int testCases = 1;
//    cin >> testCases;
    while (testCases--) TT();
    return 0;
}