Cod sursa(job #904909)
| Utilizator | Data | 4 martie 2013 23:31:35 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#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;
}
