【PAT】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).

翻译：英国天文学家Eddington喜欢骑自行车。据说，为了炫耀自己的本领，他甚至定义了一个“Eddington数”，即一个人骑了超过E英里的时间为E天的最大整数E。爱丁顿自己的E是87。
现在给定一个人Ｎ天的骑车里程，你需要找出相应的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.

翻译：每个输入文件包含一组测试数据。对于每组测试数据，第一行给定一个正整数N (≤10⁵),表示连续骑行的日子。然后下一行给出N个非负整数，表示每天的骑行距离。

Output Specification:

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

翻译：对于每组测试数据，输出一行N天的Eddington数。

---

Sample Input:

10
6 7 6 9 3 10 8 2 7 8

---

Sample Output:

6

---

解题思路

将数列排序后倒着搜索，当前数字小于E+1时就停止。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<algorithm>
#define INF 99999999
#define bug puts("Hello\n")
using namespace std;
int N,v[100010];
int main(){
	scanf("%d",&N);
	for(int i=0;i<N;i++)scanf("%d",&v[i]);
	sort(v,v+N);
	int E=0; 
	for(int i=N-1;i>=0;i--){
		if(v[i]>E+1)E++;
		else break;
	} 
	printf("%d\n",E);
	return 0;
}