Cod sursa(job #912766)
| Utilizator | Data | 12 martie 2013 18:28:54 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.83 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
FILE*f,*g;
int j,nr,v[10000],c[10000],m,p,i,n;
int main()
{
f=fopen("elmaj.in","r");
g=fopen("elmaj.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(f,"%d",&v[i]);
}
sort(v+1,v+n+1);
n=n+1;
v[n]=0;
m=0;
for(i=1;i<n;i++)
{
if(v[i]==v[i+1])
{
c[i]=j;
j++;
}
else
{
c[i]=j;
j=1;
}
if(c[i]>m)
{
m=c[i];
nr=v[i];
}
}
fprintf(g,"%d %d",nr,m);
fclose(f);
fclose(g);
return 0;
}