Pagini recente » Cod sursa (job #2945271) | Cod sursa (job #707714) | Cod sursa (job #746871) | Cod sursa (job #128872) | Cod sursa (job #656976)
Cod sursa(job #656976)
#include<stdio.h>
#include<algorithm>
using namespace std;
int el,k,i,n,a[1000003];
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]);
nth_element(a+1,a+n/2,a+n+1);
el=a[n/2];
for(i=1;i<=n;i++)
if(a[i]==el) k++;
if(k>=n/2+1) printf("%d %d\n",el,k);
else printf("-1\n");
return 0;
}