class Solution {
public:
static bool cmp(int x, int y)
{
return x>y;
}
int hIndex(vector<int>& c) {
int n = c.size();
sort(c.begin(), c.end(), cmp);
for(int i= 0; i<c.size();i++)
{
if(i>=c[i]) return i;
}
return c.size();
}
};