1117 Eddington Number （25 分）

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).

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


分析：水题，先排序

 1 /**
 2 * Copyright(c)
 3 * All rights reserved.
 4 * Author : Mered1th
 5 * Date : 2019-02-27-19.43.40
 6 * Description : A1117
 7 */
 8 #include<cstdio>
 9 #include<cstring>
10 #include<iostream>
11 #include<cmath>
12 #include<algorithm>
13 #include<string>
14 #include<unordered_set>
15 #include<map>
16 #include<vector>
17 #include<set>
18 using namespace std;
19 const int maxn=100010;
20 int a[maxn];
21 bool cmp(int a,int b){
22     return a>b;
23 }
24 int main(){
25 #ifdef ONLINE_JUDGE
26 #else
27     freopen("1.txt", "r", stdin);
28 #endif
29     int n,i;
30     scanf("%d",&n);
31     for(i=1;i<=n;i++){
32         scanf("%d",&a[i]);
33     }
34     sort(a+1,a+n+1,cmp);
35     for(i=1;i<=n;i++){
36         if(a[i]<=i) break;
37     }
38     cout<<i-1;
39     return 0;
40 }

 

转载于:https://www.cnblogs.com/Mered1th/p/10447139.html