Pagini recente » Cod sursa (job #1558605) | Istoria paginii runda/simulare2005 | Cod sursa (job #1143609) | Cod sursa (job #1500603) | Cod sursa (job #2147865)
#include <cstdio>
#include <map>
using namespace std;
const int nmax=1000000;
map<int,int> ap;
int n,v[nmax+5];
bool gasit=0;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&v[i]);
ap[v[i]]++;
}
for(int i=1;i<=n;i++)
if(ap[v[i]]>=n/2+1)
{
printf("%d %d",v[i],ap[v[i]]);
gasit=1;
break;
}
if(gasit==0)
printf("-1");
return 0;
}
/**
**/