Cod sursa(job #1082959)
Utilizator | FMI Belu Andrei Octavian tavi.belu1994 | Data | 15 ianuarie 2014 14:29:32 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
FILE *f,*g;
using namespace std;
int VIZ[100000000];
int main()
{
f=fopen("elmaj.in","r");
g=fopen("elmaj.out","w");
int N,maxim;
fscanf(f,"%d",&N);
for(int i=1 ; i<=N ; i++)
{
int x;
fscanf(f,"%d",&x);
VIZ[x]++;
if(VIZ[maxim] < VIZ[x])
maxim = x;
}
if(VIZ[maxim] > N/2)
fprintf(g,"%d %d",maxim,VIZ[maxim]);
else
fprintf(g,"-1");
fclose(f);
fclose(g);
return 0;
}