#include <iostream>
#include <cstdio>
#include <queue>
#include <string>
#include <algorithm> //for max
using namespace std;
const int M = 10000;
int main()
{
int n;
long long a[100000];
scanf("%d",&n);
for(int i=0; i<n; i++)
scanf("%lld",&a[i]);
sort(a,a+n);
int cnt = 0;
long long nownum,nowmax=0,allmax=0,ans[100001];
nownum = a[0];
for(int i=0; i<n; i++){
if(nownum!=a[i]){
nownum = a[i];
nowmax = 0;
}
if(nownum==a[i]){
nowmax++;
}
if(nowmax>allmax){
allmax = nowmax;
cnt=0;
}
if(nownum==a[i] && nowmax == allmax){
ans[cnt] = a[i];
cnt++;
}
}
cout << cnt << endl;
for(int i=0; i<cnt; i++)
cout << ans[i] << " ";
return 0;
}
众数
最新推荐文章于 2022-03-23 19:57:32 发布