Cod sursa(job #2408268)
Utilizator | Data | 17 aprilie 2019 19:17:17 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,a[1000001],nr;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>a[i];
for(int i=1; i<n; i++)
{
if(a[i])
{
nr=1;
for(int j=1+i; j<=n; j++)
{
if(a[i]==a[j])
{
a[j]=0;
nr++;
}
}
int x=n/2;
if(nr>=x)
g<<a[i]<<' ';
nr=0;
}
}
return 0;
}