Cod sursa(job #904843)
Utilizator | Data | 4 martie 2013 21:34:02 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
using namespace std;
#include<fstream>
#include<algorithm>
ifstream eu("elmaj.in");
ofstream tu("elmaj.out");
int a[1000001],n,nr;
int main()
{
int i,j;
eu>>n;
for(i=1;i<=n;i++)
eu>>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)
tu<<a[i];
}
return 0;
}