PAT (Advanced Level)1117. Eddington Number(25)

最新推荐文章于 2024-05-07 12:18:40 发布

X_空

最新推荐文章于 2024-05-07 12:18:40 发布

阅读量227

点赞数

分类专栏： PAT-AL

本文链接：https://blog.csdn.net/kxg6666/article/details/79533924

版权

PAT-AL 专栏收录该内容

64 篇文章 0 订阅

订阅专栏

1117. Eddington Number(25)

时间限制

250 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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⁵), 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:

耗时10分钟左右

这道题正确率0.24？？？真的怪，为什么我费那么大劲弄懂得题正确率都超高，这道题这么简单竟然

题意理解有点费劲，大意是：给一组数，找出其中比X大的数且其在这组数中的数量>=X，输出满足题意的X的最大值。记得考虑这组数全为零的情形。

//Mar12_No5_PATAL1118

#include <iostream>
using namespace std;

int main() {
	int n, cnt, count, a[100001];
	cin >> n;
	for (int i = 0; i < n; i++) 
		cin >> a[i];
	for (int i = 0; i <=n; i++) {
		cnt = n - i;
		count = n;
		for (int j = 0; j < n; j++) 
			if (a[j] <= cnt) 
				count--;
		if (count >= cnt) {
			cout << cnt << endl;
			break;
		}
	}
	return 0;
}