2018ACM-CCPC湖南湘潭邀请赛 A Easy h-index

Easy h-index

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0

Problem Description

比赛题目：
http://acm.hdu.edu.cn/downloads/2018ccpc_hn.pdf

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 citations exactly i, find the h-index of Bobo.

 

Input

The input consists of several test cases and is terminated by end-of-file.

The first 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

11 221 2 330 0 0 0

Sample Output

120

//有i篇影响因子为a[i]的论文

#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0;i<=n;i++)
            scanf("%d",&a[i]);
        int sum=0;
        int i;
        for(i=n;i>=0;i--)
        {
            sum=sum+a[i];
            if(sum>=i)
                break;
        }
        printf("%d\n",i);
    }
    return 0;
}

Sample Output

120