Cod sursa(job #1576326)
| Utilizator | Data | 22 ianuarie 2016 11:59:32 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000010],a[99999999],i,x,n,nrmax,nr,elemaj;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
nrmax=-1;
for(i=1;i<=n;i++)
{
a[v[i]]++;
if(a[v[i]]>nrmax)
{
nrmax=a[v[i]];
elemaj=v[i];
}
}
if(nrmax>=n/2+1)
g<<elemaj<<" "<<nrmax;
else
g<<-1;
return 0;
}
