Cod sursa(job #1576222)
| Utilizator | Data | 22 ianuarie 2016 11:02:39 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000010],n,i,q[99999999],Max1,Max,u;
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>v[i];
if(v[i]>Max)
{
Max=v[i];
}
}
Max1=n/2+1;
for(i=1;i<=n;++i)
{
q[v[i]]++;
}
u=0;
for(i=1;i<=Max;++i)
{
if(q[i]>=Max1)
{
u=i;
}
}
if(u==0)
{
g<<-1;
}
else
g<<u<<" "<<Max1;
return 0;
}
