这道题可以用map来做

#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
cin>>n;
map<int, int> countMap;
int half = n / 2;
for (int i = 0; i < n; i) {
int num;
cin >> num;
countMap[num];
if (countMap[num] > half) {
cout << num << endl;
return 0;
}
}
return 0;
}