Pagini recente » Cod sursa (job #545988) | Cod sursa (job #2748537) | Cod sursa (job #1173519) | Cod sursa (job #1835132) | Cod sursa (job #904909)
Cod sursa(job #904909)
#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000001],n,nr;
int main()
{
int i,j;
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
sort(a+1,a+n+1);
for(i=1;i<=n;i++)
{
nr=0;
for(j=i;j<=n;j++)
if(a[j]==a[i])
nr++;
if(nr>n/2)
printf("%d ",a[i]);
}
return 0;
}