Cod sursa(job #822884)
Utilizator | Ungureanu Mihnea UMihnea | Data | 24 noiembrie 2012 10:15:27 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
using namespace std;
int i,n,e,cnt,x[1000010];
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&x[i]);
if(cnt==0)
{
e=x[i];
cnt++;
}
else if(x[i]==e)cnt++;
else cnt--;
}
cnt=0;
for(i=1;i<=n;i++)
if(x[i]==e)
cnt++;
if(cnt>n-cnt)printf("%d %d",e,cnt);
else printf("-1");
return 0;
}