Cod sursa(job #649769)
Utilizator | Data | 16 decembrie 2011 18:04:27 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
long a[1000000];
int main()
{long n,i;
FILE *fin, *fout;
fin=fopen("elmaj.in","r");
fout=fopen("elmaj.out","w");
fscanf(fin,"%d\n",&n);
int x;
for(i=0;i<n;i++)
{fscanf(fin,"%d",&x);
a[x]++;
}
int max=0;
int m;
for(i=0;i<n;i++)
if(a[i]>max)
{max=a[i];
m=i;
}
if(max>n/2)
fprintf(fout,"%d %d", max,m);
else
fprintf(fout,"-1");
fclose(fin);
fclose(fout);
}