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 xi boxes on its top (we’ll call xi 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.
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 than xi 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 x1,x2,…,xn (0≤xi≤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.
In example 2, we can build only 1 pile that contains boxes 1, 2, 3, 4, 5 (from top to bottom).
题目大意
有n个纸盒,上面标明在这个盒子上面最多能放几个盒子. 问最后最少可以放成几个堆.
解题思路
先把纸盒的承重排序,然后考虑从堆的上面最小的开始放,直到放到最大的,然后新开一个堆….以此类推
代码;const int INF = 1000000000;const int maxn = 110;int n;int s[maxn];bool used[maxn];int main(){scanf(“%d”,&n);for(int i = 0 ; i < n ; i ++) scanf(“%d”,&s[i]);sort(s,s+n);for(int i = 0 ; i < n ; i ++) used[i] = false;int cnt = 0;for(int i = 0 ; i < n ; i ++) {if(!used[i]) {int pile = 1;used[i] = true;for(int j = i+1 ; j < n ; j ++) {if(!used[j] && pile <= s[j]) {used[j] = true;pile ++;}}cnt ++;}}printf(“%d\n”,cnt);return 0;}
，发光并非太阳的专利，我也可以发光 。
