Young Explorers(贪心

https://www.luogu.com.cn/problem/CF1355B

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+9;
int a[N];
map<int,int> mp;
set<int> s;
int t,n;
int main(){
	cin>>t;
	while(t--){
		mp.clear();
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
			mp[a[i]]++;
			s.insert(a[i]);
		}
		int sum=0,l=0;
		for(auto it:s){
			sum+=(l+mp[it])/it;
//			cout<<(l+mp[it])/it<<' ';
			l=(l+mp[it])%it;
		}
		cout<<sum<<'\n';
	}
	return 0;
}