#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
class Solution{
public :
int findLucky( vector< int > & arr) {
int i;
int cnt[ 501 ] = { } ;
int N = arr.size ( ) ;
for ( i= ( 0 ) ; i< ( N) ; i++ ) {
cnt[ arr[ i] ] ++ ;
}
for ( i= ( 501 ) - 1 ; i>= ( 1 ) ; i-- ) {
if ( cnt[ i] == i) {
return i;
}
}
return - 1 ;
}
}
;
// cLay varsion 20200325-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// class Solution {
// public:
// int findLucky(vector<int>& arr) {
// int cnt[501] = {}, N = arr.size();
// rep(i,N) cnt[arr[i]]++;
// rrep(i,1,501) if(cnt[i]==i) return i;
// return -1;
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbWFpbiBkdW1teV9tYWluCmludCBtYWluKCl7CiAgcmV0dXJuIDA7Cn0KI3VuZGVmIG1haW4KY2xhc3MgU29sdXRpb257CiAgcHVibGljOgogIGludCBmaW5kTHVja3kodmVjdG9yPGludD4mIGFycil7CiAgICBpbnQgaTsKICAgIGludCBjbnRbNTAxXSA9IHt9OwogICAgaW50IE4gPSBhcnIuc2l6ZSgpOwogICAgZm9yKGk9KDApO2k8KE4pO2krKyl7CiAgICAgIGNudFthcnJbaV1dKys7CiAgICB9CiAgICBmb3IoaT0oNTAxKS0xO2k+PSgxKTtpLS0pewogICAgICBpZihjbnRbaV09PWkpewogICAgICAgIHJldHVybiBpOwogICAgICB9CiAgICB9CiAgICByZXR1cm4gLTE7CiAgfQp9CjsKLy8gY0xheSB2YXJzaW9uIDIwMjAwMzI1LTEKCi8vIC0tLSBvcmlnaW5hbCBjb2RlIC0tLQovLyAjZGVmaW5lIG1haW4gZHVtbXlfbWFpbgovLyB7fQovLyAjdW5kZWYgbWFpbgovLyAKLy8gY2xhc3MgU29sdXRpb24gewovLyBwdWJsaWM6Ci8vICAgaW50IGZpbmRMdWNreSh2ZWN0b3I8aW50PiYgYXJyKSB7Ci8vICAgICBpbnQgY250WzUwMV0gPSB7fSwgTiA9IGFyci5zaXplKCk7Ci8vICAgICByZXAoaSxOKSBjbnRbYXJyW2ldXSsrOwovLyAgICAgcnJlcChpLDEsNTAxKSBpZihjbnRbaV09PWkpIHJldHVybiBpOwovLyAgICAgcmV0dXJuIC0xOwovLyAgIH0KLy8gfTsK