Submission #66559999

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N=3e5+10;
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
map<int,int> mp;
int n,m,k;
int a[N],b[N];
void slove(){
    cin>>n;
    vector<int> q;
    for(int i=1;i<=n;i++) {
        int x;cin>>x;
        q.push_back(x);
    }
    sort(q.begin(),q.end());
    // for(int i=0;i<n;i++)cout<<q[i]<<' ';
    // cout<<endl;
    for(int x=n;x>=1;x--){
        int ans=lower_bound(q.begin(),q.end(),q[x-1])-q.begin();
        // cout<<ans+1<<endl;
        if(n-ans>=q[x-1]){
            cout<<q[x-1]<<endl;
            return;
        }
    }
    
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
    int T=1;
    // cin>>T;
    while(T--){
        slove();
    }
}

Submission Info

Judge Result