Pagini recente » Clasament test_11 | Istoria paginii runda/simulare-cartita-12 | Istoria paginii runda/preoji-10 | Cod sursa (job #1653079) | Cod sursa (job #1096989)
#include<cstdio>
using namespace std;
int i,n,a[1000001],nr,el;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
el=a[1];
nr=1;
for(i=2;i<=n;i++)
{
if(a[i]!=el)
{
nr--;
}
else nr++;
if(nr<0)
{
el=a[i];
nr=1;
}
}
nr=0;
for(i=1;i<=n;i++)
{
if(a[i]==el)
{
nr++;
}
}
if(nr>=n/2+1)
{
printf("%d %d\n",el,nr);
}
else printf("-1\n");
return 0;
}