[USACO18OPEN] Lemonade Line

Description

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 N 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 wi 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.

Input

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

Output

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

Example

input

5
7 1 400 2 2

output

3

Note

In this setting, only three cows might end up in line (and this is the smallest possible).

Suppose the cows with w=7 and w=400 arrive first and wait in line.

Then the cow with w=1 arrives and turns away, since 2 cows are already in line. The cows with w=2 then arrive, one staying and one turning away.

解析

每只奶牛都有一个忍耐的排队数，如果前面的牛太多他就不排了哈哈哈...

然后现在问你去排队的奶牛最少有多少头

那当然是忍耐值越大的先排，忍耐值小的在后面肯定不排了...(排序就好)

代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
int w[100005];
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int n;
    int i,ans=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)
        scanf("%d",&w[i]);
    sort(w,w+n,cmp);//排个序，从大到小
    for(i=0;i<n;i++)
        if(w[i]>=ans)//能忍的奶牛
            ans++;
    printf("%d\n",ans);
    return 0;
}