Pagini recente » Cod sursa (job #2502465) | Cod sursa (job #513162) | Cod sursa (job #2140694) | Cod sursa (job #365900) | Cod sursa (job #1612379)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NMax = 200000005;
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;
}