wdewfrefer

#include<bits/stdc++.h> 
using namespace std; 
int main() { 
int n; 
cin >> n; 
int a[n]; 
//数组a赋值 
for (int i = 0; i < n; i++) { 
 cin >> a[i]; 
} 
int m = 1001; 
int b[m];//b[0]~b[10]分别用来保存1~10的出现次数 
for (int i = 1; i < m; i++) { 
 b[i] = 0; //出现次数初始化为0 
} 
//遍历数组a 
for (int i = 0; i < n; i++) { 
 int x = a[i]; 
 b[x] = b[x] + 1; //次数+1 
} 
//求数组b除b[0]外的最大值 
int d = 1; 
for (int i = 2; i < m; i++) { 
 if (b[i] > b[d]) { 
  d = i; 
 } 
} 
cout << d; 
return 0; 
}