貪心/CoderForces 228c Fox and Box Accumulation

來源:互聯網
上載者:User

標籤:style   blog   io   color   sp   for   on   div   log   

 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4 using namespace std; 5 int a[110]; 6 int main() 7 { 8     int n; 9     scanf("%d",&n);10     for (int i=1;i<=n;i++) scanf("%d",&a[i]);11     sort(a+1,a+n+1);12     int left=n;13     int ans=0;14     while (left>0)15     {16         int now=0;17         for (int i=1;i<=n;i++)18         {19             if (now<=a[i])20             {21                 a[i]=-1;22                 now++;23                 left--;24             }25         }26         ans++;27     }28     printf("%d\n",ans);29     return 0;30 }

 

貪心/CoderForces 228c Fox and Box Accumulation

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.