Pagini recente » Cod sursa (job #1888163) | Cod sursa (job #1715164) | Cod sursa (job #1379150) | Cod sursa (job #2989442) | Cod sursa (job #660636)
Cod sursa(job #660636)
#include <cstdio>
#include<algorithm>
using namespace std;
int a[1000005];
int main () {
int i,n,c=1;
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i)scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(i=1;i<n;++i){
if(a[i]==a[i+1]){
c=c+1;
}else{
if(c>=n/2){
printf("%d %d",a[i],c);
return 0;
}
c=1;
}
}
printf("-1");
return 0;
}