#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
const int MAX = 100010, INF = 1<<30;
int N, E;
int S[MAX] = {0};
int main()
{
scanf("%d", &N);
for(int i=1; i<=N; i++) scanf("%d", &S[i]);
sort(S+1, S+N+1, greater<int>());//从大到小排序
for(int i=1; i<=N && S[i]>i; E=i, i++);//找到E天大于E的最大的E
printf("%d", E);
return 0;
}
PAT (Advanced Level) Practice A1117 Eddington Number (25 分)(C++)(甲级)(排序)
最新推荐文章于 2024-05-07 12:18:40 发布