Cod sursa(job #664224)
| Utilizator | Data | 19 ianuarie 2012 20:20:43 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int n,nr,i,a[1000000],MAX,MAX1,x;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for (i=1; i<=n; i++)
{
scanf("%d",&nr);
a[nr]++;
if (MAX<nr) MAX=nr;
}
for (i=1; i<=MAX; i++)
{
if (a[nr]>=MAX1)
{
x=nr;
MAX1=a[nr];
}
}
if (MAX1>n/2) printf("%d %d",x,MAX1 );
return 0;
}
