Pagini recente » Cod sursa (job #469015) | Cod sursa (job #3245143) | Cod sursa (job #297581) | Cod sursa (job #1617410) | Cod sursa (job #2635243)
#include <fstream>
#include <map>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n,x;
map <int,int> m;
pair <int,int> maxim;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x;
m[x]++;
if(maxim.second<m[x])
{
maxim.second=m[x];
maxim.first=x;
}
}
maxim.second>=n/2+1?(cout<<maxim.first<<" "<<maxim.second):cout<<-1;
return 0;
}