#1117. Eddington Number【枚举 + 排序】

原题链接

Problem Description：

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$ ($\le N$).

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer $N$ ($\le 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

Problem Analysis:

先将所有骑车里程数从小到大排序，然后从数组末尾往前枚举，由于一共只有 $N$ 个里程数，因此 $E$ 必满足 $E\le N$，因此可以从大到小枚举 $E$，然后往前数 $E$ 个数，看倒数第 $n-E$ 个数是否大于 $E$，如果是，则输出，并且这个数就是所要求的最大的 $E$。

Code

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1e5 + 10;

int n;
int a[N];

int main()
{
    cin >> n;
    for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
    
    sort(a, a + n);
    for (int i = n; i; i -- )
        if (a[n - i] > i)
        {
            printf("%d", i);
            return 0;
        }
    puts("0");
    return 0;
}