Cod sursa(job #1166180)
Utilizator | Data | 3 aprilie 2014 12:34:57 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
using namespace std;
long long int n,uz[200000000];
int main()
{freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%lld",&n);
long long int max=-1,nr,x;
for(int i=1;i<=n;i++)
{
scanf("%lld",&x);
uz[x]++;
if(uz[x]>max) max=uz[x],nr=x;
}
printf("%lld %lld",nr,max);
}