Cod sursa(job #1068535)
Utilizator | Data | 28 decembrie 2013 14:14:41 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
#include<map>
using namespace std;
long i, n, x, rez;
map <long, long> nr;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%ld",&n);
for (i=1;i<=n;i++)
{
scanf("%ld",&x);
nr[x]++;
if (nr[x]*2+1>=n)
rez=x;
}
if (nr[rez]*2+1>=n)
printf("%ld %ld",rez,nr[rez]);
else
printf("-1");
return 0;
}