Cod sursa(job #1612382)
| Utilizator | Data | 24 februarie 2016 20:26:22 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NMax = 2000005;
int N,X[NMax];
void Read()
{
fin>>N;
for(int i = 1; i<=N; i++)
{
int val;
fin>>val;
X[val]++;
}
}
void SolveandPrint()
{
int Max = 0,Sol;
for(int i = 1; i <= NMax; i++)
{
if(X[i] > Max)
{
Max = X[i];
Sol = i;
}
}
if(Max > N/2)
{
fout<<Sol<<" "<<Max<<"\n";
}
else
fout<<"-1\n";
}
int main()
{
Read();
SolveandPrint();
return 0;
}
