Mai intai trebuie sa te autentifici.
Cod sursa(job #1389683)
Utilizator | Data | 16 martie 2015 15:29:43 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
using namespace std;
long long a[2000001],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++)
{
x[i]=0;
}
MAX=0;
NR=0;
for(i=1;i<=n;i++)
{
fin>>a[i];
x[a[i]]++;
if(x[a[i]]>MAX)
{
MAX=x[a[i]];
NR=a[i];
}
}
if(MAX>=n/2+1)
{
fout<<NR<<" "<<MAX;
}
else
{
fout<<"-1";
}
fin.close();
fout.close();
return 0;
}