Contest1389 - 2018年第三阶段个人训练赛第四场.Lemonade Line（水题）

问题 E: Lemonade Line

时间限制: 1 Sec  内存限制: 128 MB
提交: 259  解决: 161
[提交] [状态] [讨论版] [命题人:admin]

题目描述

It's a hot summer day out on the farm, and Farmer John is serving lemonade to his N cows! All N cows (conveniently numbered 1…N) like lemonade, but some of them like it more than others. In particular, cow ii is willing to wait in a line behind at most wiwi cows to get her lemonade. Right now all NN cows are in the fields, but as soon as Farmer John rings his cowbell, the cows will immediately descend upon FJ's lemonade stand. They will all arrive before he starts serving lemonade, but no two cows will arrive at the same time. Furthermore, when cow ii arrives, she will join the line if and only if there are at most wiwi cows already in line.
Farmer John wants to prepare some amount of lemonade in advance, but he does not want to be wasteful. The number of cows who join the line might depend on the order in which they arrive. Help him find the minimum possible number of cows who join the line.

 

输入

The first line contains N, and the second line contains the N space-separated integers w1,w2,…,wN. It is guaranteed that 1≤N≤105, and that 0≤wi≤109 for each cow i.

 

输出

Print the minimum possible number of cows who might join the line, among all possible orders in which the cows might arrive.

 

样例输入

5
7 1 400 2 2

 

样例输出

3

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int a[n+10],cnt=0;
        for(int i=0; i<n; i++)   scanf("%d",&a[i]);
        sort(a,a+n);
        for(int i=n-1; i>=0; i--)
        {
            if(a[i]>=cnt)
                cnt++;
        }
        printf("%d\n",cnt);
    }
}