#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
class Solution{
public :
bool isMajorityElement( vector< int > & nums, int target) {
int N, cnt= 0 , i;
N = nums.size ( ) ;
for ( i= 0 ; i< ( N) ; i++ ) {
if ( nums[ i] == target) {
cnt++ ;
}
}
return 2 * cnt > N;
}
}
;
// cLay varsion 20190817-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// class Solution {
// public:
// bool isMajorityElement(vector<int>& nums, int target) {
// int i, N, cnt = 0;
// N = nums.size();
// rep(i,N) if(nums[i]==target) cnt++;
// return 2cnt > N;
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbWFpbiBkdW1teV9tYWluCmludCBtYWluKCl7CiAgcmV0dXJuIDA7Cn0KI3VuZGVmIG1haW4KY2xhc3MgU29sdXRpb257CiAgcHVibGljOgogIGJvb2wgaXNNYWpvcml0eUVsZW1lbnQodmVjdG9yPGludD4mIG51bXMsIGludCB0YXJnZXQpewogICAgaW50IE4sIGNudD0wLCBpOwogICAgTiA9IG51bXMuc2l6ZSgpOwogICAgZm9yKGk9MDtpPChOKTtpKyspewogICAgICBpZihudW1zW2ldPT10YXJnZXQpewogICAgICAgIGNudCsrOwogICAgICB9CiAgICB9CiAgICByZXR1cm4gMipjbnQgPiBOOwogIH0KfQo7Ci8vIGNMYXkgdmFyc2lvbiAyMDE5MDgxNy0xCgovLyAtLS0gb3JpZ2luYWwgY29kZSAtLS0KLy8gI2RlZmluZSBtYWluIGR1bW15X21haW4KLy8ge30KLy8gI3VuZGVmIG1haW4KLy8gCi8vIGNsYXNzIFNvbHV0aW9uIHsKLy8gcHVibGljOgovLyAgIGJvb2wgaXNNYWpvcml0eUVsZW1lbnQodmVjdG9yPGludD4mIG51bXMsIGludCB0YXJnZXQpIHsKLy8gICAgIGludCBpLCBOLCBjbnQgPSAwOwovLyAgICAgTiA9IG51bXMuc2l6ZSgpOwovLyAgICAgcmVwKGksTikgaWYobnVtc1tpXT09dGFyZ2V0KSBjbnQrKzsKLy8gICAgIHJldHVybiAyY250ID4gTjsKLy8gICB9Ci8vIH07Cg==