22 lines
446 B
C++
22 lines
446 B
C++
|
#include <bits/stdc++.h>
|
||
|
|
|
||
|
|
using namespace std;
|
||
|
|
const int N = 1e6 + 10;
|
||
|
|
int a[N];
|
||
|
|
unordered_map<int, int> _map;
|
||
|
|
int main() {
|
||
|
|
int n;
|
||
|
|
cin >> n;
|
||
|
|
for (int i = 1; i <= n; i++) cin >> a[i], _map[a[i]]++;
|
||
|
|
bool flag = false;
|
||
|
|
for (int i = 1; i <= n; i++)
|
||
|
|
if (_map[a[i]] > n / 2) {
|
||
|
|
cout << a[i];
|
||
|
|
flag = true;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
|
||
|
|
if (!flag) cout << "No";
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|