Codeforces Round #228 (Div. 2) C. Fox and Box Accumulation（贪心）

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <algorithm>
 6 using namespace std;
 7 
 8 int main()
 9 {
10     int n,a[110],f[110],sum,x;
11     int i,j;
12     while(cin>>n)
13     {
14         sum=0;
15         for(i=0; i<n; i++)
16         cin>>a[i];
17 
18         sort(a,a+n);
19         memset(f,0,sizeof(f));
20         for(j=0; j<n; j++)
21         {
22             x=0;
23             for(i=0; i<n; i++)
24             {
25                if(a[i]>=x&&f[i]==0)
26                {
27                    x++;
28                    f[i]=1;
29                }
30             }
31             if(x==0)
32             break;
33             sum++;
34         }
35         printf("%d\n",sum);
36     }
37     return 0;
38 }