Submission #66539378

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int n, m;
vector<int>v;

int check(int mid){
    int cnt=0;
    cnt = lower_bound(v.begin() , v.end() , mid)-v.begin();
    cnt = n-cnt;

    return cnt>=mid;
}

void solve()
{
    // Add your solution here
    // int n;
    cin>>n;
    v.resize(n);
    for(int i=0 ; i<n ; i++){
        cin>>v[i];
    }
    sort(v.begin() , v.end());
    int lo=0 , hi = v[n-1];
    int ans=0;
    while(lo<=hi){
        int mid = (lo+hi)/2;
        if(check(mid)){
            ans = mid;
            lo = mid+1;
        }
        else{
            hi=mid-1;
        }
    }
    cout<<ans<<endl;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Submission Info

Judge Result