Pagini recente » Cod sursa (job #672365) | Cod sursa (job #3237594) | Cod sursa (job #2245233) | Cod sursa (job #1380886) | Cod sursa (job #681094)
Cod sursa(job #681094)
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;
for(i=1;i<=n;i++)
if(v[i]==v[m]) c++;
if(c>=(n/2+1))
printf("%d %d",v[m],c);
else
printf("-1");
return 0;
}