Pagini recente » Cod sursa (job #2399236) | Cod sursa (job #1412994) | Cod sursa (job #635892) | Cod sursa (job #3251576) | Cod sursa (job #681311)
Cod sursa(job #681311)
using namespace std;
#include<cstdio>
#include<algorithm>
#define Max 10000
int v[Max];
int main()
{
int i,n,m,c=0;
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
sort(v+1,v+n+1);
m=(n+1)/2;
m=v[m];
for(i=1;i<=n;i++)
if(v[i]==m) c++;
if(c>=(n/2+1))
printf("%d %d",m,c);
else
printf("-1");
return 0;
}