A.Easy h-index

A. Easy h-index

The h-index of an author is the largest h where he has at least h papers with citations not less than h.
Bobo has published many papers. Given a0,a1,a2,…,an which means Bobo has published ai papers with
itations exactly i, ﬁnd the h-index of Bobo.

Input

The input consists of several test cases and is terminated by end-of-ﬁle.
The ﬁrst line of each test case contains an integer n. The second line contains (n+1) integers a0,a1,…,an.

Output

For each test case, print an integer which denotes the result.

Constraint

• 1≤ n ≤2·105 • 0≤ ai ≤109 • The sum of n does not exceed 250,000.

Sample Input

1
1 2
2
1 2 3
3
0 0 0 0


Sample Output

1
2
0


  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22  #include "bits/stdc++.h" using namespace std; int main(){ int a[200005]; int n; int i; while(cin>>n){ for(i=0;i<=n;i++) cin>>a[i]; int sum=a[n]; for(i=n;i>=0;){ if(sum>=i){ cout<