Cod sursa(job #1746975)
Utilizator | Data | 24 august 2016 11:59:17 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, i, max1, max2, fr[1000001], elmaj1, elmaj2, x;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>x;
fr[x]++;
if(fr[x]>max1)
{
max1=fr[x];
elmaj1=x;
}
}
if(max1>=n/2+1)
fout<<elmaj1<<" "<<max1;
else
fout<<-1;
return 0;
}