Cod sursa(job #2009562)
| Utilizator | Data | 9 august 2017 23:29:26 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.5 kb |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 1000002
int n, fr[1000001],x, Max,nr;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d", &n);
int i;
for(i = 1 ; i <= n; i++){
scanf("%d",&x);
fr[x]++;
if( fr[x] > Max){
nr = x;
Max = fr[x];
}
}
if( Max >= n/2 + 1 )
printf("%d %d", nr, Max);
else printf("-1");
return 0;
}
