Pagini recente » Cod sursa (job #2949688) | Cod sursa (job #956414) | Cod sursa (job #722115) | Cod sursa (job #2520124) | Cod sursa (job #660710)
Cod sursa(job #660710)
#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000005];
int main () {
int i,n,k=n/2+1,c=0;
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d %d",&n);
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",a[k],c);
return 0;
}
printf("-1");
return 0;
}