Cod sursa(job #1455503)
| Utilizator | Data | 28 iunie 2015 03:49:44 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
int occurances[1000010];
int main(){
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
int N, x, i, candidate;
bool flag = false;
scanf("%d ", &N);
for (i=0; i<N; i++){
scanf("%d ", &x);
occurances[x] ++;
if(occurances[x] >= N/2 +1){
candidate = x;
flag = true;
}
}
if(flag == false)
printf("-1");
else
printf("%d %d", candidate, occurances[candidate]);
return 0;
}
