#include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll N=500005;
ll n,a[N],ans=0;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for (ll i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+n+1,greater<ll>());
for (ll i=1;i<=n;i++)
if (a[i]>ans) ans++;
else break;
cout<<ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
472 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
604 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
16 ms |
3164 KB |
Output is correct |
9 |
Correct |
59 ms |
7668 KB |
Output is correct |
10 |
Correct |
37 ms |
4392 KB |
Output is correct |