Submission

[PPPPPPPPPPPT]

Score: 0

User: Jibhong

Problemset: 01.H-index

Language: cpp

Time: 1.030 second

Submitted On: 2025-03-31 14:41:50

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int n;
    cin >> n;
    
    vector<int> mem(n);
    for (int i = 0; i < n; ++i) {
        cin >> mem[i];
    }

    sort(mem.begin(), mem.end());

    int last = mem[0];
    int cnt = 1, out = 0;

    for (int i = 1; i <= n; ++i) {
        if (i < n && mem[i] == last) {
            ++cnt;
            continue;
        }

        out = max(out, min(last, n - i + cnt));

        if (last < out) break;

        cnt = 1;
        if (i < n) last = mem[i];
    }

    cout << out;
    return 0;
}