Cod sursa(job #915911)
Utilizator | Hancu Andrei ucnah | Data | 15 martie 2013 15:33:15 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int ap[200000000],n,imax,maxim,x;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&x);
ap[x]++;
if(maxim<ap[x])
{
maxim=ap[x];
imax=x;
}
}
if(maxim>=n/2+1)
printf("%d %d\n",imax,maxim);
else
printf("-1\n");
return 0;
}