Codeforces Round #228 (Div. 2)C. Fox and Box Accumulation-CSDN博客

本文链接：https://blog.csdn.net/kuangzhenxi/article/details/18926563

本文介绍了一个有趣的算法问题——盒子堆叠。目标是最小化所需堆叠的盒子数量，同时考虑到每个盒子的最大承载力限制。文章提供了详细的输入输出样例及解释，并附带了一段C++代码实现。

摘要由CSDN通过智能技术生成

Fox Ciel has n boxes in her room. They have the same size and weight, but they might have different strength. The i-th box can hold at most x_i boxes on its top (we'll call x_i the strength of the box).

Since all the boxes have the same size, Ciel cannot put more than one box directly on the top of some box. For example, imagine Ciel has three boxes: the first has strength 2, the second has strength 1 and the third has strength 1. She cannot put the second and the third box simultaneously directly on the top of the first one. But she can put the second box directly on the top of the first one, and then the third box directly on the top of the second one. We will call such a construction of boxes a pile.

$\text{[math]}$

Fox Ciel wants to construct piles from all the boxes. Each pile will contain some boxes from top to bottom, and there cannot be more thanx_i boxes on the top of i-th box. What is the minimal number of piles she needs to construct?

Input

The first line contains an integer n (1 ≤ n ≤ 100). The next line contains n integers x₁, x₂, ..., x_n (0 ≤ x_i ≤ 100).

Output

Output a single integer — the minimal possible number of piles.

   Sample test(s) 
 
     input 
   
3
0 0 10

     output 
   
2

     input 
   
5
0 1 2 3 4

     output 
   
1

     input 
   
4
0 0 0 0

     output 
   
4

     input 
   
9
0 1 0 2 0 1 1 2 10

     output 
   
3

Note

In example 1, one optimal way is to build 2 piles: the first pile contains boxes 1 and 3 (from top to bottom), the second pile contains only box 2.

$\text{[math]}$

In example 2, we can build only 1 pile that contains boxes 1, 2, 3, 4, 5 (from top to bottom).

$\text{[math]}$

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#include <algorithm>
int t;
int stu[110];
int main()
{
    int i,j;
    while(~scanf("%d",&t))
    {
        for(i=1;i<=t;++i)
        {
            scanf("%d",&stu[i]);
        }
        sort(stu+1,stu+t+1);
        int ans=0;
        for(i=1;i<=t;++i)
        {
            int k=0;
            for(j=1;j<=t;++j)
            {
                if(stu[j]>=k)
                {
                    k++;stu[j]=-1;
                }
            }
            if(k!=0)
                ans++;
            sort(stu+1,stu+t+1);
        }
        printf("%d\n",ans);
    }
    return 0;
}