Cod sursa(job #663379)
| Utilizator | Data | 18 ianuarie 2012 13:54:13 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int a[1000000],n,i,maxnr,maxim,poz,x;
int main ()
{
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
f >>n;
maxim=0;
for (i=1; i<=n; i++)
{
f >>x;
a[x]++;
if (x>maxim) maxim=x;
}
maxnr=0; poz=0;
for (i=0; i<=maxim; i++)
if (a[i]>maxnr)
{
maxnr=a[i];
poz=i;
}
if (maxnr>=n/2) g <<poz <<' '<<maxnr;
else g << -1;
return 0;
}
