1117 Eddington Number (25分)

British astronomer Eddington liked to ride a bike. It is said that in order to show off his skill, he has even defined an “Eddington number”, E – that is, the maximum integer E such that it is for E days that one rides more than E miles. Eddington’s own E was 87.

Now given everyday’s distances that one rides for N days, you are supposed to find the corresponding E (≤N).

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10^​5), the days of continuous riding. Then N non-negative integers are given in the next line, being the riding distances of everyday.

Output Specification:

For each case, print in a line the Eddington number for these N days.

Sample Input:

10
6 7 6 9 3 10 8 2 7 8

Sample Output:

6

题⽬⼤意：

英国天⽂学家爱丁顿很喜欢骑⻋。据说他为了炫耀⾃⼰的骑⻋功⼒，还定义了⼀个“爱丁顿
数”E，即满⾜有E天骑⻋超过E英⾥的最⼤整数E。据说爱丁顿⾃⼰的E等于87。

分析：

在数组a中存储n天的公⾥数，对n个数据从⼤到⼩排序，i表示了骑⻋的天数，那么满⾜a[i] > i+1
的最⼤i+1即为所求

//1117 Eddington Number (25分)
#include <iostream>
#include <algorithm>
using namespace std;
int a[1000000];
int main()
{
	int n, e = 0;
	scanf("%d", &n);
	for(int i = 0; i < n; i++)
		scanf("%d", &a[i]);
	sort(a, a+n, greater<int>());
	while(e < n && a[e] > e+1) 
		e++;
	printf("%d", e);
	return 0;
}