Pagini recente » Cod sursa (job #3122918) | Cod sursa (job #1672756) | Cod sursa (job #405019) | Cod sursa (job #1246045) | Cod sursa (job #1490358)
#include <iostream>
#include <fstream>
#include <map>
#include <vector>
using namespace std;
int n;
map<int,int> m;
vector<int> v;
void read()
{
scanf("%d ",&n);
int x;
for(int i=0;i<n;i++)
{
scanf("%d ",&x);
if(m.find(x)==m.end())
v.push_back(x);
m[x]++;
}
}
bool solve()
{
for(int i=0;i<v.size();i++)
if(m[v[i]]>n/2)
{printf("%d %d",v[i],m[v[i]]);
return true;}
return false;
}
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
read();
if(!solve())
printf("-1");
return 0;
}