Submission

[P-SSSSSSSSSS]

Score: 0

User: pxsit

Problemset: 01.H-index

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-31 07:57:26

#pragma GCC optimize("Ofast,fast-math,unroll-loops,no-stack-protector,unsafe-math-optimizations,inline,inline-small-functions,inline-functions")
#include <bits/stdc++.h>
#pragma GCC target("avx2,bmi,bmi2,sse4.2,popcnt,lzcnt,tune=native")
#define endl '\n'
#define endll cout << '\n';
#define sp ' '
#define cinn int n;cin>> n;
#define testcase int t;cin>>t;while(t--)
const int INF = 1e9;
const long long LINF = 1e18;
const int mod = 1e9+7;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

int32_t main(){ios::sync_with_stdio(false); cin.tie(nullptr);
    cinn;
    int mx = 0;
    vector<int> a(n);
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    sort(a.begin(),a.end());
    // for(auto i : a){
    //     cout << i << sp;
    // }
    for(int i=0;i<=n;i++){
        if(a[i] > n) break;
        if(n-(lower_bound(a.begin(),a.end(),i)-a.begin()) >= i) mx = i;
    }
    cout << mx;
}