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