Pagini recente » Cod sursa (job #2731075) | Cod sursa (job #2365341) | Cod sursa (job #2967621) | Cod sursa (job #2857728) | Cod sursa (job #660711)
Cod sursa(job #660711)
#include <cstdio>
#include <algorithm>
using namespace std;
int v[3000005];
int main(){
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
int n,i,cont=0;
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&v[i]);
nth_element(v+1,v+n/2+1,v+n+1);
for(i=1;i<=n;++i)
if(v[i]==v[n/2+1])
++cont;
if(cont>n/2){
printf("%d %d",v[n/2+1],cont);
return 0;
}
printf("-1");
}