Cod sursa(job #1108339)
Utilizator | Serbanescu Andrei Victor Ratheba | Data | 15 februarie 2014 16:37:13 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 1000005
int v[MAX],n,fr[MAX],i,maxim=0,sol,nr=0;
bool comp(int a, int b)
{
return a<b;
}
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(i=1; i<=n; i++)
scanf("%d",&v[i]);
sort(v+1,v+n+1,comp);
for(i=2; i<=n; i++)
{
if(v[i] != v[i-1])
fr[++nr]=1;
fr[nr]++;
}
for(i=1; i<=n; i++)
if(fr[maxim] < fr[nr])
maxim=nr;
printf("%d %d",fr[maxim],maxim);
return 0;
}