Pagini recente » Cod sursa (job #2142424) | Cod sursa (job #327185) | Cod sursa (job #475795) | Cod sursa (job #283448) | Cod sursa (job #660634)
Cod sursa(job #660634)
#include <cstdio>
#include <algorithm>
using namespace std;
int s[1000005];
int main(){
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
int n,i,lg=1;
bool OK=0;
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&s[i]);
sort(s+1,s+n+1);
for(i=2;i<=n;++i){
if(s[i]==s[i-1])
++lg;
else{
if(lg>=n/2+1){
OK=1;
printf("%d %d ",s[i-1],lg);
}
lg=1;
}
}
if(!OK)puts("-1");
}