Pagini recente » Cod sursa (job #1381143) | Cod sursa (job #2240844) | Istoria paginii runda/hc_round10 | Cod sursa (job #492771) | Cod sursa (job #1479551)
#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000005],aux[1000005],n;
void citire()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]),aux[i]=a[i];
}
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
citire();
nth_element(aux+1,aux+n/2,aux+n+1);
int num=aux[n/2],nr=0;
for(int i=1;i<=n;i++)
if(a[i]==num)
nr++;
if(nr>n/2)
printf("%d %d\n",num,nr);
else
printf("-1\n");
return 0;
}