Cod sursa(job #1665567)
| Utilizator | Data | 27 martie 2016 08:20:12 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("elmmaj.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]++;
max1=0;
max2=0;
elmaj1=0;
elmaj2=0;
for(i=1; i<=1000000; i++)
if(fr[i]>max1)
max1=fr[i], elmaj1=i;
for(i=1; i<=1000000; i++)
if(fr[i]>max2 and i!=elmaj1)
max2=fr[i], elmaj2=i;
if(max1==max2)
fout<<-1;
else
fout<<elmaj1<<" "<<max1;
return 0;
}
