Cod sursa(job #1389682)
Utilizator | Data | 16 martie 2015 15:28:04 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
long long a,x[2000001],MAX,NR;
int i,n;
int main ()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a;
x[a]++;
if(x[a]>MAX)
{
MAX=x[a];
NR=a;
}
}
if(MAX>=n/2+1)
{
fout<<NR<<" "<<MAX;
}
else
{
fout<<"-1";
}
fin.close();
fout.close();
return 0;
}