Pagini recente » Cod sursa (job #2838769) | Cod sursa (job #1567707) | Cod sursa (job #1271374) | Cod sursa (job #2882785) | Cod sursa (job #660717)
Cod sursa(job #660717)
#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000005];
int main () {
int i,n,k,c=0;
/*freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);*/
scanf("%d",&n);
k=n/2+1;
for(i=1;i<=n;++i)scanf("%d",&a[i]);
nth_element(a+1,a+k,a+n+1);
for(i=1;i<=n;++i){
if(a[i]==a[k]){
c=c+1;
}
}
if(c>n/2){
printf("%d %d",a[k],c);
return 0;
}
printf("-1");
return 0;
}