舞狮--贪心+优先

int a[N];
void solve()
{
   int n;cin>>n;
   for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+1+n);
   priority_queue<int,vector<int>,greater<int>> heap;
   heap.push(1);
   for(int i=2;i<=n;i++)
   {
     if(heap.size()&&heap.top()+1<=a[i])
     {
        int len=heap.top();
        heap.pop();
        heap.push(len+1);
     }
     else heap.push(1);
   }
   cout<<heap.size();
}