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 integerEsuch that it is forEdays that one rides more thanEmiles. Eddington's ownEwas 87.

Now given everyday's distances that one rides forNdays, you are supposed to find the correspondingE(≤).

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integerN(≤), the days of continuous riding. ThenNnon-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 theseNdays.

Sample Input:

10
6 7 6 9 3 10 8 2 7 8

Sample Output:

6

 1 #include <iostream>
 2 #include <vector>
 3 #include <algorithm>
 4 using namespace std;
 5 int n;
 6 int main()
 7 {
 8     cin >> n;
 9     vector<int>v(n);
10     for (int i = 0; i < n; ++i)
11         cin >> v[i];
12     sort(v.begin(), v.end());
13     int k = 0;
14     for (k = 0; k < n; ++k)
15         if (v[k] > n - k)
16             break;
17     cout << n - k;
18     return 0;
19 }

赞赏

长按二维码向我转账

受苹果公司新规定影响，微信 iOS 版的赞赏功能被关闭，可通过二维码转账支持公众号。

微信扫一扫
关注该公众号