Cod sursa(job #1292345)
Utilizator | Data | 14 decembrie 2014 10:31:59 | |
---|---|---|---|
Problema | Koba | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <iostream>
#include <limits.h>
using namespace std;
int n,m,i,Max,fr[1000001],x;
int main()
{
cin>>n>>m;
Max=INT_MIN;
for(i=1;i<=m*n;i++)
{
cin>>x;
fr[x]++;
if(Max<fr[x])
Max=fr[x];
}
for(i=0;i<=1000000;i++)
{
if(fr[i]==Max)
cout<<i<<" ";
}
return 0;
}