1117 Eddington Number

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⁵), 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。
设置一个数组dis存储每天骑车的距离，按降序排列，遍历该数组，找到第一个使i>=dis[i]的整数i。

AC代码

#include <iostream>
#include <algorithm>
using namespace std;

int dis[100010];
bool cmp(int a, int b){
	return a > b;
}

int main(){
	int n;
	cin>>n;
	for(int i = 1; i <= n; i++)
		cin>>dis[i];
	sort(dis + 1, dis + n + 1, cmp);
	int ans = 0, j = 1;
	while(ans <= n && dis[j] > j){
		ans++;j++;
	}
	cout<<ans;
	return 0;
}