Cod sursa(job #1017868)
Utilizator | CHIRILA ADRIAN Sapientia | Data | 28 octombrie 2013 16:08:12 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <cstdio>
#define Nmax 1000001
using namespace std;
int v[Nmax],u[Nmax];
int i,j,n,maxim=0,e;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i)
{
scanf("%d",&v[i]);
++u[v[i]];
if(u[v[i]]>maxim) {maxim=u[v[i]];e=v[i];}
}
if (maxim<n/2+1) printf("%d",-1);
else printf("%d %d",e,maxim);
return 0;
}