1117 Eddington Number (25 point(s))

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

分析： 这里的E天不要求连续（emmm，连续就成动态规划了变得麻烦了），那就用数组存储下距离，然后从大到小排个序，只要满足天数大于距离，就往后扫数组，直到找到一个最大E。

完整代码：

#include<bits/stdc++.h>
using namespace std;
bool cmp(int a,int b){
	return a>b;
}
int main(){
	int n;
	cin>>n;
	vector<int>v(n);
	for(int i=0;i<n;i++)
	    cin>>v[i];
	sort(v.begin(),v.end(),cmp);
	int cnt=0;
	while(v[cnt]>cnt+1 && cnt<n) cnt++;     
	cout<<cnt<<endl;
	return 0;
}

That‘s all ！