Cod sursa(job #1168745)
| Utilizator | Data | 9 aprilie 2014 14:23:29 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
FILE *f=fopen("elmaj.in","r");
FILE *g=fopen("elmaj.out","w");
int n,v[1000001],i,x,nr,j;
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
sort(v+1,v+n+1);
i=n/2+1;
j=i-1;
x=v[n/2];
while(v[i]==x){nr++;i++;}
while(v[j]==x){nr++;j--;}
if(nr>n/2)
fprintf(g,"%d %d",x,nr);
else fprintf(g,"-1");
return 0;
}
