【剑指紫金港】1117 Eddington Number 大年初一第一篇！

A 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 (≤N).

Input

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

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

题目大意：

给出n个数，其中大于x的数刚好有x个，求出这个最大的x。

解题思路：

x最大的可能是n，从大往小找。先将n个数从小到大排序，然后从下标为0的数（i=0）开始，对于0~miles[i]之间的所有可能的x，大于x的共有n-i个，找到第一个等于n-i的x就是答案。

AC代码

#include<bits/stdc++.h>
using namespace std;

int main(){
    int n,ans=0,flag=0;
    scanf("%d",&n);
    vector<int> miles(n);
    for(int i=0;i<n;i++) scanf("%d",&miles[i]);
    sort(miles.begin(),miles.end());
    for(int i=0;i<n;i++){
        int num=n-i;
        for(int j=0;j<miles[i];j++){
            if(num==j){
                ans=num;
                flag=1;
                break;
            }
        }
        if(flag) break;
    }
    printf("%d",ans);
}