Cod sursa(job #805915)
| Utilizator | Data | 1 noiembrie 2012 14:49:09 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f=fopen("elmaj.in","r");
FILE *g=fopen("elmaj.out","w");
int i,n,x,v[20000000],k,mx,mx2;
int main()
{
fscanf(f,"%d",&n);
mx=0;
mx2=0;
for(i=1;i<=n;i++)
{
fscanf(f,"%d",&x);
v[x]++;
if (x>mx ) mx=x;
}
for (i=1;i<=mx;i++)
if(v[i]>=n / 2+1) if (v[i]>mx2){mx2=v[i]; k=i;};
fprintf(g,"%d %d",k,mx2);
return 0;
}
