标签：des style blog code java ext
codeforces-388A
Description
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 Input
3
0 0 10
5
0 1 2 3 4
4
0 0 0 0
9
0 1 0 2 0 1 1 2 10
Sample Input
2
1
4
3
大意：给一些箱子，每个箱子都有自己的强度，若为n，表示它上面最多能摞n个箱子。
问：最少能把这些箱子摞成几摞。
分析：从上往下摞，贪心。
贪心-codeforces-388A-Fox and Box Accumulation,布布扣,bubuko.com
贪心-codeforces-388A-Fox and Box Accumulation
标签：des style blog code java ext
原文地址：http://blog.csdn.net/chuchus/article/details/25192871
