Pagini recente » Cod sursa (job #414568) | Cod sursa (job #482069) | Cod sursa (job #543967) | Rating lazarrares (lazarrares) | Cod sursa (job #1609112)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NMax = 1000005;
int Sol,Max,N,V[NMax];
void Read()
{
fin>>N;
for(int i = 1; i <= N; ++i)
{
int x;
fin>>x;
V[x]++;
}
}
void SolveandPrint()
{
for(int i = 1; i<=NMax; i++)
if(V[i] > Max)
{
Max = V[i];
Sol = i;
}
if(Max > (N/2))
fout<<Sol<<" "<<Max<<"\n";
else
fout<<"-1\n";
}
int main()
{
Read();
SolveandPrint();
return 0;
}